Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages

DOI10.1080/00207169708804609zbMath0890.68081OpenAlexW2167047250WikidataQ126245998 ScholiaQ126245998MaRDI QIDQ4375397

Alexander Meduna

Publication date: 11 June 1998

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169708804609

zbMATH Keywords

multi-sequential grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Middle quotients of linear languages

Cites Work

• On the generative power of regular pattern grammars
• Six nonterminals are enough for generating each r.e. language by a matrix grammar
• Multi grammars

This page was built for publication: Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages