Sciweavers

CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 10 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