Searching for "On the transition graphs of turing machines." – sorted by Relevance.
-
On a Chomsky like Hierarchy of Infinite Graphs
- and in [16, 8] for Turing machines. Besides transition graphs, innite graphs may be dened using those
- Add To MetaCart
-
REWRITING SYSTEMS OVER UNRANKED TREES von
- these kinds of graphs are very strong (both classes contain e.g. the transition graphs of Turing machines
- Add To MetaCart
-
Ground Tree Rewriting Graphs of Bounded Tree Width
- transition graphs of Turing machines, reachability problems are undecidable on these graphs, but the rst
- Cited by 3 (1 self) – Add To MetaCart
-
Context-sensitive languages, rational graphs and determinism
- graphs [Cau96, Cau03a], rational graphs [Mor00] and transition graphs of Turing machines [Cau03b] (for a
- Cited by 4 (2 self) – Add To MetaCart

