The following pages link to (Q4413828):
Displayed 24 items.
- An infinite hierarchy of languages defined by dP systems (Q418824) (← links)
- On the computational complexity of membrane systems (Q596128) (← links)
- P systems with symport/antiport simulating counter automata (Q707498) (← links)
- On the properties of language classes defined by bounded reaction automata (Q714826) (← links)
- P automata revisited (Q714827) (← links)
- (Mem)brane automata (Q953539) (← links)
- Solving the N-queens problem using dP systems with active membranes (Q1643128) (← links)
- Minimizing evolution communication P systems and automata (Q1762935) (← links)
- Tissue P systems with channel states (Q1763703) (← links)
- Computationally universal P systems without priorities: Two catalysts are sufficient (Q1763714) (← links)
- Theory of reaction automata: a survey (Q1983008) (← links)
- The computational capability of chemical reaction automata (Q2311219) (← links)
- Membrane automata for modeling biomolecular processes (Q2311302) (← links)
- On the classes of languages characterized by generalized P colony automata (Q2413313) (← links)
- P transducers (Q2493275) (← links)
- Variants of Distributed P Automata and the Efficient Parallelizability of Languages (Q2890282) (← links)
- Finite dP Automata versus Multi-head Finite Automata (Q2890286) (← links)
- Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\omega $$-Languages (Q2945564) (← links)
- P and dP Automata: A Survey (Q3003474) (← links)
- On the Parallelizability of Languages Accepted by P Automata (Q3009345) (← links)
- Promoters and Inhibitors in Purely Catalytic P Systems (Q3454886) (← links)
- P Automata: Membrane Systems as Acceptors (Q3507428) (← links)
- The Computing Power of Determinism and Reversibility in Chemical Reaction Automata (Q5112176) (← links)
- Binding-blocking automata (Q5416433) (← links)