Sciweavers

ACTA
2006
74views more  ACTA 2006»
13 years 5 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