Membrane systems languages are polynomial-time parsable

zbMATH Open1232.68049MaRDI QIDQ652889FDOQ652889

Authors: Artiom Alhazov, Constantin Ciubotaru, Sergiu Ivanov, Yurii Rogozhin 

Publication date: 5 January 2012

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

Recommendations

• The Family of Languages Generated by Non-cooperative Membrane Systems
• P systems with active membranes working in polynomial space
• scientific article; zbMATH DE number 1735640
• Membrane Computing
• Unconventional Computation

zbMATH Keywords

membrane computingP systemsmembrane systems languagesparsability

Mathematics Subject Classification ID

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

Cited In (1)

• The Family of Languages Generated by Non-cooperative Membrane Systems

This page was built for publication: Membrane systems languages are polynomial-time parsable

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