Variants of Distributed P Automata and the Efficient Parallelizability of Languages

DOI10.1007/978-3-642-28024-5_5zbMath1350.68115OpenAlexW1444958491MaRDI QIDQ2890282

György Vaszil

Publication date: 8 June 2012

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28024-5_5

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• An infinite hierarchy of languages defined by dP systems
• P and dP Automata: A Survey
• On the Parallelizability of Languages Accepted by P Automata
• P Finite Automata and Regular Languages over Countably Infinite Alphabets
• DNA Computing
• P Automata: Concepts, Results, and New Aspects
• A Computational Complexity Theory in Membrane Computing

This page was built for publication: Variants of Distributed P Automata and the Efficient Parallelizability of Languages