P and dP Automata: A Survey

DOI10.1007/978-3-642-19391-0_8zbMath1327.68157OpenAlexW134284498MaRDI QIDQ3003474

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

Publication date: 27 May 2011

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

Full work available at URL: https://idus.us.es/handle//11441/70700

Mathematics Subject Classification ID

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

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 ⋮ Decomposition and factorization of chemical reaction transducers ⋮ Reaction automata ⋮ An infinite hierarchy of languages defined by dP systems ⋮ Theory of reaction automata: a survey ⋮ On the properties of language classes defined by bounded reaction automata

Cites Work

• On the computational complexity of P automata
• P Finite Automata and Regular Languages over Countably Infinite Alphabets
• Membrane Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: P and dP Automata: A Survey