Representing recursively enumerable languages by iterated deletion
From MaRDI portal
Publication:1826643
DOI10.1016/j.tcs.2004.01.002zbMath1072.68055OpenAlexW1986652500MaRDI QIDQ1826643
Michael Domaratzki, Alexander Okhotin
Publication date: 6 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.01.002
Related Items
Unnamed Item, On the computing powers of \(\mathcal{L}\)-reductions of insertion languages, Parallel contextual array insertion deletion P systems and tabled matrix grammars
Cites Work