scientific article; zbMATH DE number 1951584
From MaRDI portal
Publication:4413828
Recommendations
Cited in
(30)- Solving the N-queens problem using dP systems with active membranes
- Minimizing evolution communication P systems and automata
- Tissue P systems with channel states
- Computationally universal P systems without priorities: Two catalysts are sufficient
- Theory of reaction automata: a survey
- The computational capability of chemical reaction automata
- Membrane automata for modeling biomolecular processes
- On the classes of languages characterized by generalized P colony automata
- P transducers
- Hierarchical automata and P-systems
- Variants of distributed P automata and the efficient parallelizability of languages
- Finite dP Automata versus Multi-head Finite Automata
- Going beyond Turing with P automata: partial adult halting and regular observer -languages
- P and dP automata: a survey
- On the parallelizability of languages accepted by P automata
- Promoters and inhibitors in purely catalytic P systems
- P Automata: Membrane Systems as Acceptors
- Automata on Multisets of Communicating Objects
- An infinite hierarchy of languages defined by dP systems
- Generalized Communicating P Automata
- The computing power of determinism and reversibility in chemical reaction automata
- Binding-blocking automata
- A general approach for building combinationalPautomata
- Membrane Computing
- On the computational complexity of membrane systems
- Variants of tissue P systems with prescribed teams of channel rules
- P systems with symport/antiport simulating counter automata
- On the properties of language classes defined by bounded reaction automata
- P automata revisited
- (Mem)brane automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4413828)
