Finite dP Automata versus Multi-head Finite Automata

DOI10.1007/978-3-642-28024-5_10MaRDI QIDQ2890286zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Multi-head finite automata: characterizations, concepts and open problems
• Some characterizations of multihead finite automata
• Multi-head finite automata: Data-independent versus data-dependent computations
• A NOTE ON MULTIHEAD FINITE-STATE AUTOMATA
• Complexity of multi-head finite automata: origins and directions
• scientific article; zbMATH DE number 1361488
• scientific article; zbMATH DE number 3383997
• On multi-head automata with restricted nondeterminism
• On Stateless Multihead Finite Automata and Multihead Pushdown Automata
• Alternating multihead finite automata

Cites work

• scientific article; zbMATH DE number 5671765 (Why is no real title available?)
• scientific article; zbMATH DE number 1951584 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• An infinite hierarchy of languages defined by dP systems
• Complexity of multi-head finite automata: origins and directions
• On Multi-Head Finite Automata
• On non-determinacy in simple computing devices
• On the computational complexity of P automata
• On the power of P and dP automata
• P and dP automata: a survey
• P automata: concepts, results, and new aspects

Cited in

(8)

• A NOTE ON MULTIHEAD FINITE-STATE AUTOMATA
• An infinite hierarchy of languages defined by dP systems
• Some characterizations of multihead finite automata
• Complexity of multi-head finite automata: origins and directions
• scientific article; zbMATH DE number 1361488 (Why is no real title available?)
• P automata revisited
• Multi-head finite automata: Data-independent versus data-dependent computations
• On Counter Machines versus dP Automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890286)