Infinite Computations and a Hierarchy in Δ 3
From MaRDI portal
Publication:5425368
DOI10.1007/978-3-540-73001-9_68zbMath1150.03316OpenAlexW2040673363MaRDI QIDQ5425368
Branislav Rovan, Ľuboš Steskal
Publication date: 13 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_68
Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10) Hierarchies of computability and definability (03D55)
Related Items (1)
This page was built for publication: Infinite Computations and a Hierarchy in Δ 3