Pages that link to "Item:Q876857"
From MaRDI portal
The following pages link to On the computational complexity of P automata (Q876857):
Displayed 5 items.
- On the properties of language classes defined by bounded reaction automata (Q714826) (← links)
- P automata revisited (Q714827) (← links)
- Finite dP Automata versus Multi-head Finite Automata (Q2890286) (← links)
- P and dP Automata: A Survey (Q3003474) (← links)
- P Automata: Membrane Systems as Acceptors (Q3507428) (← links)