Variants of distributed P automata and the efficient parallelizability of languages

DOI10.1007/978-3-642-28024-5_5MaRDI QIDQ2890282zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the parallelizability of languages accepted by P automata
• P and dP automata: unconventional versus classical automata
• P and dP automata: a survey
• scientific article; zbMATH DE number 1490952
• On Counter Machines versus dP Automata

Cites work

• scientific article; zbMATH DE number 1951584 (Why is no real title available?)
• A computational complexity theory in membrane computing
• An infinite hierarchy of languages defined by dP systems
• DNA Computing
• On the parallelizability of languages accepted by P automata
• On the power of P and dP automata
• P Finite Automata and Regular Languages over Countably Infinite Alphabets
• P and dP automata: a survey
• P automata: concepts, results, and new aspects

Cited in

(4)

• Distributed processing in automata
• scientific article; zbMATH DE number 7260573 (Why is no real title available?)
• On the parallelizability of languages accepted by P automata
• scientific article; zbMATH DE number 1531819 (Why is no real title available?)

This page was built for publication: Variants of distributed P automata and the efficient parallelizability of languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890282)