A note on the recursive enumerability of some classes of recursively enumerable languages

DOI10.1016/0020-0255(78)90029-4zbMath0416.68065OpenAlexW2039140045MaRDI QIDQ754652

Peter van Emde Boas, Paul M. B. Vitányi

Publication date: 1978

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(78)90029-4

zbMATH Keywords

recursive enumerabilityinfinite recursive languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• On the generative power of transformational grammars
• The constructivity of maximal dual ideals in certain Boolean algebras
• On restrictions on transformational grammars reducing the generative power
• On restricting the base component of transformational grammars

This page was built for publication: A note on the recursive enumerability of some classes of recursively enumerable languages