On the Parallelizability of Languages Accepted by P Automata

DOI10.1007/978-3-642-20000-7_14zbMath1331.68081OpenAlexW206891392MaRDI QIDQ3009345

György Vaszil

Publication date: 24 June 2011

Published in: Computation, Cooperation, and Life (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20000-7_14

Mathematics Subject Classification ID

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

Related Items (2)

Variants of Distributed P Automata and the Efficient Parallelizability of Languages ⋮ Solving the N-queens problem using dP systems with active membranes

Cites Work

• DNA Computing
• A Computational Complexity Theory in Membrane Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Parallelizability of Languages Accepted by P Automata