P automata revisited

DOI10.1016/j.tcs.2012.01.036zbMath1280.68119OpenAlexW1963937263MaRDI QIDQ714827

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

Publication date: 11 October 2012

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

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

zbMATH Keywords

closure propertiesChomsky hierarchymembrane computingP automata

Mathematics Subject Classification ID

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

Related Items (3)

Theory of reaction automata: a survey ⋮ P colonies. Survey ⋮ P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An infinite hierarchy of languages defined by dP systems
• On the computational complexity of P automata
• Membrane computing. An introduction.
• P transducers
• Finite dP Automata versus Multi-head Finite Automata
• P Finite Automata and Regular Languages over Countably Infinite Alphabets
• Membrane Computing
• Membrane Computing

This page was built for publication: P automata revisited