REMARKS ON CONTEXT-FREE PARALLEL COMMUNICATING GRAMMAR SYSTEMS GENERATING CROSSED AGREEMENTS

DOI10.1142/S0129054108006017zbMath1164.68011OpenAlexW2143949739MaRDI QIDQ3526541

Bianca Truthe

Publication date: 25 September 2008

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

Full work available at URL: https://doi.org/10.1142/s0129054108006017

zbMATH Keywords

context-free grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Cites Work

• PC grammar systems with five context-free components generate all recursively enumerable languages.