Finite dP Automata versus Multi-head Finite Automata
From MaRDI portal
Publication:2890286
DOI10.1007/978-3-642-28024-5_10zbMath1350.68166MaRDI QIDQ2890286
Erzsébet Csuhaj-Varjú, György Vaszil
Publication date: 8 June 2012
Published in: Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28024-5_10
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An infinite hierarchy of languages defined by dP systems
- Complexity of multi-head finite automata: origins and directions
- On the computational complexity of P automata
- On non-determinacy in simple computing devices
- P and dP Automata: A Survey
- On Multi-Head Finite Automata
- P Automata: Concepts, Results, and New Aspects