P automata revisited
From MaRDI portal
Publication:714827
DOI10.1016/J.TCS.2012.01.036zbMATH Open1280.68119OpenAlexW1963937263MaRDI QIDQ714827FDOQ714827
Authors: Gheorghe Păun, Mario J. Pérez-Jiménez 
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.036
Recommendations
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Membrane computing. An introduction.
- Title not available (Why is that?)
- P transducers
- Title not available (Why is that?)
- Title not available (Why is that?)
- An infinite hierarchy of languages defined by dP systems
- Title not available (Why is that?)
- On the power of P and dP automata
- Membrane Computing
- Finite dP Automata versus Multi-head Finite Automata
- P Finite Automata and Regular Languages over Countably Infinite Alphabets
- Membrane Computing
- On the computational complexity of P automata
Cited In (19)
- Theory of reaction automata: a survey
- A general approach for building combinationalPautomata
- P colonies. Survey
- On languages of P automata
- Title not available (Why is that?)
- Going beyond Turing with P automata: partial adult halting and regular observer \(\omega\)-languages
- Membrane Computing
- On a class ofPautomata
- Membrane Computing
- Title not available (Why is that?)
- On the parallelizability of languages accepted by P automata
- Red–Green P Automata
- Postfix automata
- P automata: concepts, results, and new aspects
- On the power of P automata
- P and dP automata: unconventional versus classical automata
- Arithmetics with P-machines
- P automata with restricted power
- Chocolate P automata
This page was built for publication: P automata revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714827)
