Sciweavers

11 search results - page 1 / 3
» Families of automata characterizing context-sensitive langua...
Sort
View
LICS
2007
IEEE
14 years 5 months ago
A Robust Class of Context-Sensitive Languages
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 11 months ago
Context-Sensitive Languages, Rational Graphs and Determinism
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
Arnaud Carayol, Antoine Meyer
ACTA
2005
96views more  ACTA 2005»
13 years 10 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
ACTA
2006
74views more  ACTA 2006»
13 years 11 months ago
Linearly bounded infinite graphs
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
Arnaud Carayol, Antoine Meyer
ENTCS
2008
100views more  ENTCS 2008»
13 years 11 months ago
A Calculus for Team Automata
Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patter...
Maurice H. ter Beek, Fabio Gadducci, Dirk Janssens