An application of dynamic P systems: Generating context-free languages

DOI10.1007/3-540-36490-0_7MaRDI QIDQ4413820zbMATH OpenFDO

Authors Gemma Bel-Enguix, Matteo Cavaliere, Radu Gramatovici, Carlos Martín-Vide, Rodica Ceterchi

Publication date 21 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2597/25970090.htm

Mathematics Subject Classification ID

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

Recommendations

• Dynamic P systems
• On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms
• scientific article; zbMATH DE number 5271
• REMARKS ON CONTEXT-FREE PARALLEL COMMUNICATING GRAMMAR SYSTEMS GENERATING CROSSED AGREEMENTS
• On the computational power of context-free PC grammar systems

Cited in

(3)

• Languages generated by P systems with active membranes
• Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems
• Dynamic P systems

This page was built for publication: An application of dynamic P systems: Generating context-free languages

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