An infinite hierarchy of languages defined by dP systems

DOI10.1016/j.tcs.2011.12.053zbMath1279.68095OpenAlexW2085299476MaRDI 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 computingdP systeminfinite hierarchysimple matrix grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (9)

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 ⋮ Solving the N-queens problem using dP systems with active membranes ⋮ The computational power of enzymatic numerical P systems working in the sequential mode ⋮ RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS ⋮ P automata revisited ⋮ P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA ⋮ Languages of distributed reaction systems

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

This page was built for publication: An infinite hierarchy of languages defined by dP systems