Sciweavers

141 search results - page 6 / 29
» The Pragmatic Roots of Context
Sort
View
ICGI
2000
Springer
13 years 11 months ago
Constructive Learning of Context-Free Languages with a Subpansive Tree
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimo...
COMBINATORICS
2006
144views more  COMBINATORICS 2006»
13 years 8 months ago
On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups
This note deals with a formula due to G. Labelle for the summed cycle indices of all rooted trees, which resembles the well-known formula for the cycle index of the symmetric grou...
Stephan G. Wagner
DLT
2007
13 years 9 months ago
Duplication Roots
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...
Peter Leupold
GSEM
2007
Springer
14 years 2 months ago
A Policy Language for Integrating Heterogeneous Authorization Policies
In order to manage and enforce multiple heterogeneous authorization policies in distributed authorization environment, we defined the root policy specification language and its cor...
Wei Zhou, Christoph Meinel
AINA
2009
IEEE
14 years 2 months ago
CCA: A Calculus of Context-Aware Ambients
We present a process calculus, CCA, for the modelling and verification of mobile systems that are context-aware. This process calculus is built upon the calculus of mobile ambien...
François Siewe, Antonio Cau, Hussein Zedan