Recommendations
Cites work
- scientific article; zbMATH DE number 5604070 (Why is no real title available?)
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 1951584 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- An infinite hierarchy of languages defined by dP systems
- Finite dP Automata versus Multi-head Finite Automata
- Membrane Computing
- Membrane Computing
- Membrane computing. An introduction.
- On the computational complexity of P automata
- On the power of P and dP automata
- P Finite Automata and Regular Languages over Countably Infinite Alphabets
- P transducers
Cited in
(19)- Theory of reaction automata: a survey
- A general approach for building combinationalPautomata
- P colonies. Survey
- On languages of P automata
- scientific article; zbMATH DE number 1951584 (Why is no real title available?)
- Going beyond Turing with P automata: partial adult halting and regular observer \(\omega\)-languages
- On a class ofPautomata
- Membrane Computing
- Membrane Computing
- scientific article; zbMATH DE number 2040914 (Why is no real title available?)
- 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
- Chocolate P automata
- P automata with restricted power
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)
