Nondeterministic space is closed under complementation
SIAM Journal on Computing
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
Rational Graphs Trace Context-Sensitive Languages
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
A Chomsky-Like Hierarchy of Infinite Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
A Short Introduction to Infinite Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Synchronized Product of Linear Bounded Machines
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Iterated Length-Preserving Rational Transductions
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On the transition graphs of Turing machines
Theoretical Computer Science
On relations defined by generalized finite automata
IBM Journal of Research and Development
| Hi-index | 0.00 |
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 observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of their structural properties as well as alternative characterizations in terms of rewriting systems and context-sensitive transductions. Finally, we compare these graphs to rational graphs, which are another family of automata accepting the context-sensitive languages, and prove that in the bounded-degree case, rational graphs are a strict sub-family of linearly bounded graphs.