Pages that link to "Item:Q876857"
From MaRDI portal
The following pages link to On the computational complexity of P automata (Q876857):
Displaying 8 items.
- On the properties of language classes defined by bounded reaction automata (Q714826) (← links)
- P automata revisited (Q714827) (← links)
- Theory of reaction automata: a survey (Q1983008) (← links)
- P colonies. Survey (Q2299890) (← links)
- The computational capability of chemical reaction automata (Q2311219) (← links)
- Membrane automata for modeling biomolecular processes (Q2311302) (← links)
- Finite dP Automata versus Multi-head Finite Automata (Q2890286) (← links)
- P and dP Automata: A Survey (Q3003474) (← links)
