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

DOI10.1142/S0129054108006017MaRDI QIDQ3526541zbMATH OpenOpenAlexFDO

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

Recommendations

• scientific article; zbMATH DE number 5271
• Further remarks on parallel communicating grammar systems
• Parallel communicating grammar systems: the context-sensitive case
• On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms
• scientific article; zbMATH DE number 1244203
• On the computational completeness of context-free parallel communicating grammar systems
• scientific article; zbMATH DE number 58371
• scientific article; zbMATH DE number 878951
• scientific article; zbMATH DE number 878943
• scientific article; zbMATH DE number 97565

Cites work

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

Cited in

(3)

• A possible connection between two theories: grammar systems and concurrent programming
• On the number of components for some parallel communicating grammar systems
• scientific article; zbMATH DE number 1951577 (Why is no real title available?)

This page was built for publication: REMARKS ON CONTEXT-FREE PARALLEL COMMUNICATING GRAMMAR SYSTEMS GENERATING CROSSED AGREEMENTS

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