An infinite hierarchy of languages defined by dP systems

DOI10.1016/j.tcs.2011.12.053zbMath1279.68095MaRDI QIDQ418824

Mario J. Pérez-Jiménez, Gheorghe Păun

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.053

zbMATH Keywords

membrane computing; dP system; infinite hierarchy; simple matrix grammar

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS, P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA, P automata revisited, Solving the N-queens problem using dP systems with active membranes, Languages of distributed reaction systems, The computational power of enzymatic numerical P systems working in the sequential mode, Variants of Distributed P Automata and the Efficient Parallelizability of Languages, Finite dP Automata versus Multi-head Finite Automata, dP Automata versus Right-Linear Simple Matrix Grammars

Cites Work

• Membrane computing. An introduction.
• P and dP Automata: A Survey
• Simple matrix languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item