ACTA
2005
13 years 9 months ago
2005
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...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
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...
ACTA
2006
13 years 9 months ago
2006
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...
CSL
2006
Springer
14 years 23 days ago
2006
Springer
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...
MFCS
2001
Springer
14 years 1 months ago
2001
Springer
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.