Multi-head finite automata: Data-independent \textit{versus} data-dependent computations

DOI10.1007/BFB0029973MaRDI QIDQ4699306zbMATH OpenFDO

Authors Markus Holzer

Publication date 14 August 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0029973

zbMATH Keywords

multi-head finite automata

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

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

Cited in

(4)

• Multi-head finite automata: Data-independent versus data-dependent computations
• Tight hierarchy of data-independent multi-head automata
• Finite dP Automata versus Multi-head Finite Automata
• Complexity of multi-head finite automata: origins and directions

This page was built for publication: Multi-head finite automata: Data-independent \textit{versus} data-dependent computations

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