scientific article; zbMATH DE number 1951584

zbMath1023.68039MaRDI QIDQ4413828

György Vaszil, Erzsébet Csuhaj-Varjú

Publication date: 21 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2597/25970219.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

Variants of Distributed P Automata and the Efficient Parallelizability of Languages ⋮ Finite dP Automata versus Multi-head Finite Automata ⋮ Promoters and Inhibitors in Purely Catalytic P Systems ⋮ Solving the N-queens problem using dP systems with active membranes ⋮ On the computational complexity of membrane systems ⋮ Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\omega $$-Languages ⋮ On the classes of languages characterized by generalized P colony automata ⋮ P Automata: Membrane Systems as Acceptors ⋮ An infinite hierarchy of languages defined by dP systems ⋮ The Computing Power of Determinism and Reversibility in Chemical Reaction Automata ⋮ P and dP Automata: A Survey ⋮ Theory of reaction automata: a survey ⋮ On the Parallelizability of Languages Accepted by P Automata ⋮ (Mem)brane automata ⋮ Binding-blocking automata ⋮ Minimizing evolution communication P systems and automata ⋮ Tissue P systems with channel states ⋮ Computationally universal P systems without priorities: Two catalysts are sufficient ⋮ P systems with symport/antiport simulating counter automata ⋮ P transducers ⋮ On the properties of language classes defined by bounded reaction automata ⋮ P automata revisited ⋮ The computational capability of chemical reaction automata ⋮ Membrane automata for modeling biomolecular processes