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 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.
Unable to display preview. Download preview PDF.
- [Cau96]Caucal, D.: On infinite transition graphs having a decidable monadic theory. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 194–205. Springer, Heidelberg (1996)Google Scholar
- [CM05a]Carayol, A., Meyer, A.: Context-sensitive languages, rational graphs and determinism. Submitted to publication, preliminary version (2005), available at http://www.irisa.fr/galion/acarayol/
- [CM05b]Carayol, A., Meyer, A.: Linearly bounded infinite graphs (extended version). Submitted to publication, preliminary version (2005), available at http://www.irisa.fr/galion/acarayol/
- [Pay00]Payet, É.: Thue Specifications, Infinite Graphs and Synchronized Product. PhD thesis, Université de la Réunion (2000)Google Scholar
- [Sti00]Stirling, C.: Decidability of bisimulation equivalence for pushdown processes. Technical Report EDI-INF-RR-0005, School of Informatics, University of Edinburgh (2000)Google Scholar