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

DOI10.1080/00207169708804609zbMATH Open0890.68081OpenAlexW2167047250WikidataQ126245998 ScholiaQ126245998MaRDI QIDQ4375397FDOQ4375397

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)

Cites Work

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

Cited In (2)

• Middle quotients of linear languages
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages 👍 👎
• Descriptional complexity of multi-parallel grammars 👍 👎

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)