P and dP Automata: A Survey
From MaRDI portal
Publication:3003474
DOI10.1007/978-3-642-19391-0_8zbMath1327.68157MaRDI 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
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Reaction automata, An infinite hierarchy of languages defined by dP systems, On the properties of language classes defined by bounded reaction automata, Solving the N-queens problem using dP systems with active membranes, Theory of reaction automata: a survey, Decomposition and factorization of chemical reaction transducers, 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