Finite dP Automata versus Multi-head Finite Automata

DOI10.1007/978-3-642-28024-5_10zbMath1350.68166OpenAlexW1871456602MaRDI 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

P automata revisited

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

This page was built for publication: Finite dP Automata versus Multi-head Finite Automata