On the power of cooperation: A regular representation of recursively enumerable languages
From MaRDI portal
Publication:1176482
DOI10.1016/0304-3975(91)90198-BzbMath0742.68038OpenAlexW2072965782MaRDI QIDQ1176482
Erzsébet Csuhaj-Varjú, Jozef Kelemen
Publication date: 25 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90198-b
Cites Work
- A variant of random context grammars: Semi-conditional grammars
- A representation of recursively enumerable languages by two homomorphisms and a quotient
- Some characterizations of lindenmayer systems in terms of chomsky-type grammars and stack machines
- Some remarks on derivations in general rewriting systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the power of cooperation: A regular representation of recursively enumerable languages