On the transition graphs of Turing machines.

DOI10.1016/S0304-3975(02)00655-2zbMath1044.68054MaRDI QIDQ1401268

Didier Caucal

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Formal languagesInfinite graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Solving Infinite Games in the Baire Space ⋮ Linearly bounded infinite graphs ⋮ Unnamed Item ⋮ Families of automata characterizing context-sensitive languages

Cites Work

• Synchronized rational relations of finite and infinite words
• The theory of ends, pushdown automata, and second-order logic
• Regular canonical systems
• On Relations Defined by Generalized Finite Automata
• An internal presentation of regular graphs by prefix-recognizable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the transition graphs of Turing machines.