scientific article; zbMATH DE number 2162201

zbMATH Open1060.68055MaRDI QIDQ4672908FDOQ4672908

Authors: Alexander Meduna 

Publication date: 28 April 2005

Title of this publication is not available (Why is that?)

Recommendations

• Non-returning PC grammar systems generate any recursively enumerable language with eight context-free components
• PC grammar systems with five context-free components generate all recursively enumerable languages.
• ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS
• Some results about centralized PC grammar systems
• On the size complexity of non-returning context-free PC grammar systems

zbMATH Keywords

PC grammar systems

Mathematics Subject Classification ID

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

Cited In (2)

• ON THE DESCRIPTIONAL COMPLEXITY OF METALINEAR CD GRAMMAR SYSTEMS
• Multigenerative grammar systems and matrix grammars

This page was built for publication:

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