Traces of Term-Automatic Graphs
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive languages are the languages generated by growing grammars, or equivalently those accepted by Turing machines whose work tape’s size is proportional to that of their input. A few years ago, a new characterisation of context-sensitive languages as the sets of traces, or path labels, of rational graphs (infinite graphs defined by sets of finite-state transducers) was established.
We investigate a similar characterisation in the more general framework of graphs defined by term transducers. In particular, we show that the languages of term-automatic graphs between regular sets of vertices coincide with the languages accepted by alternating linearly bounded Turing machines. As a technical tool, we also introduce an arborescent variant of tiling systems, which provides yet another characterisation of these languages.
KeywordsTuring Machine Tiling System Input Word Rational Graph Tree Transducer
Unable to display preview. Download preview PDF.
- [BG00]Blumensath, A., Grädel, E.: Automatic structures. In: Proceedings of the 15th IEEE Symposium on Logic in Computer Science (LICS 2000), pp. 51–62. IEEE, Los Alamitos (2000)Google Scholar
- [CM06]Carayol, A., Meyer, A.: Context-sensitive languages, rational graphs and determinism. Logical Methods in Computer Science 2(2) (2006)Google Scholar
- [GR96]Giammarresi, D., Restivo, A.: Handbook of Formal Languages. In: Two-dimensional languages, vol. 3, Springer, Heidelberg (1996)Google Scholar
- [KN95]Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 367–392. Springer, Heidelberg (1995)Google Scholar
- [Ris02]Rispal, C.: The synchronized graphs trace the context-sensitive languages. In: Proceedings of the 4th International Workshop on Verification of Infinite-State Systems (INFINITY 2002). Electronic Notes in Theoretical Computer Science, vol. 68 (2002)Google Scholar