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)
String-rewriting systems
Aspects of classical language theory
Handbook of formal languages, vol. 1
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
Regularity of Congruential Graphs
MFCS '00 Proceedings of the 25th 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
On Word Rewriting Systems Having a Rational Derivation
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 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
A Chomsky-Like Hierarchy of Infinite Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
A Short Introduction to Infinite Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
A process-theoretic look at automata
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |
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.