Space-bounded OTMs and REG ∞

DOI10.3233/COM-200327MaRDI QIDQ5037216

Merlin Carl

Publication date: 28 February 2022

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.05297

zbMATH Keywords

regular languagecomplexity theorydeterministic finite automatonordinal Turing machineordinal computability

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Related Items (1)

Symmetry for transfinite computability

Cites Work

• Unnamed Item
• Ordinal computability. An introduction to infinitary machines
• Automata on ordinals and automaticity of linear orders
• Koepke machines and satisfiability for infinitary propositional languages
• Turing Computations On Ordinals
• Pumping for ordinal-automatic structures1
• Decision methods in the theory of ordinals
• Logical Approaches to Computational Barriers

This page was built for publication: Space-bounded OTMs and REG ∞