Infinite Computations and a Hierarchy in 3 Reconsidered
From MaRDI portal
Publication:3611728
DOI10.1093/LOGCOM/EXN022zbMath1159.03315OpenAlexW2135108002MaRDI QIDQ3611728
Ľuboš Steskal, Branislav Rovan
Publication date: 2 March 2009
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exn022
Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10) Hierarchies of computability and definability (03D55)
This page was built for publication: Infinite Computations and a Hierarchy in 3 Reconsidered