Space-bounded OTMs and REG ∞
From MaRDI portal
Publication:5037216
DOI10.3233/COM-200327MaRDI QIDQ5037216
Publication date: 28 February 2022
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.05297
regular language; complexity theory; deterministic finite automaton; ordinal Turing machine; ordinal computability
03Dxx: Computability and recursion theory