Variants of distributed P automata and the efficient parallelizability of languages

DOI10.1007/978-3-642-28024-5_5zbMATH Open1350.68115OpenAlexW1444958491MaRDI QIDQ2890282FDOQ2890282

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

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

Mathematics Subject Classification ID

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

Cites Work

• A computational complexity theory in membrane computing
• P and dP automata: a survey
• An infinite hierarchy of languages defined by dP systems
• Title not available (Why is that?)
• On the power of P and dP automata
• P Finite Automata and Regular Languages over Countably Infinite Alphabets
• DNA Computing
• P automata: concepts, results, and new aspects
• On the parallelizability of languages accepted by P automata

Cited In (4)

• Distributed processing in automata
• Title not available (Why is that?)
• On the parallelizability of languages accepted by P automata
• Title not available (Why is that?)

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)