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

DOI10.1080/00207169708804609MaRDI QIDQ4375397zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 2050924
• Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages
• Descriptional complexity of multi-parallel grammars

Cites work

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

Cited in

(2)

• scientific article; zbMATH DE number 2050924 (Why is no real title available?)
• Middle quotients of linear languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375397)