On the regular structure of prefix rewriting
CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Synchronized rational relations of finite and infinite words
Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
Aspects of classical language theory
Handbook of formal languages, vol. 1
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?
MFCS '98 Proceedings of the 23rd 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
A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Linearly bounded infinite graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.23 |
As for pushdown automata, we consider labelled Turing machines with ε-rules. With any Turing machine M and with a rational set C of configurations, we associate the restriction to C of the ε-closure of the transition set of M. We get the same family of graphs by using the labelled word rewriting systems. We show that this family is the set of graphs obtained from the binary tree by applying an inverse mapping into F followed by a rational restriction, where F is any family of recursively enumerable languages containing the rational closure of all linear languages. We show also that this family is obtained from the rational graphs by inverse rational mappings. Finally we show that this family is also the set of graphs recognized by (unlabelled) Turing machines with labelled final states, and even if we restrict to deterministic Turing machines.