Sciweavers

426 search results - page 34 / 86
» Synchronization of Regular Automata
Sort
View
ICALP
2000
Springer
13 years 11 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick
ACTA
2005
96views more  ACTA 2005»
13 years 7 months ago
Families of automata characterizing context-sensitive languages
In the hierarchy of infinite graph families, rational graphs are defined by rational transducers with labelled final states. This paper proves that their traces are precisely conte...
Christophe Morvan, Chloe Rispal
DEDS
2002
106views more  DEDS 2002»
13 years 7 months ago
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
Peter Buchholz, Peter Kemper
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 7 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
FUIN
2007
133views more  FUIN 2007»
13 years 7 months ago
Intercode Regular Languages
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
Yo-Sub Han, Kai Salomaa, Derick Wood