Finite automata and unary languages
Theoretical Computer Science
Information Processing Letters
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Relations Among Complexity Measures
Journal of the ACM (JACM)
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Multi-head finite automata: data-independent versus data-dependent computations
Theoretical Computer Science
The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice Collapses
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Power of Cooperation and Multihead Finite Systems
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Data-Independences of Parallel Random Access Machines
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Converting two-way nondeterministic unary automata into simpler automata
Theoretical Computer Science - Mathematical foundations of computer science
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Systems of communicating finite-state machines as a distributed alternative to finite-state machines
Systems of communicating finite-state machines as a distributed alternative to finite-state machines
On the descriptional power of heads, counters, and pebbles
Theoretical Computer Science - Descriptional complexity of formal systems
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
On partially blind multihead finite automata
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On the Computational Capacity of Parallel Communicating Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Finite automata and their decision problems
IBM Journal of Research and Development
The reduction of two-way automata to one-way automata
IBM Journal of Research and Development
IBM Journal of Research and Development
A useful device for showing the solvability of some decision problems
Journal of Computer and System Sciences
On tape-bounded complexity classes and multihead finite automata
Journal of Computer and System Sciences
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Descriptional complexity of bounded context-free languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Removing bidirectionality from nondeterministic finite automata
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Descriptional complexity of two-way pushdown automata with restricted head reversals
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Finite dp automata versus multi-head finite automata
CMC'11 Proceedings of the 12th international conference on Membrane Computing
On multi-head automata with restricted nondeterminism
Information Processing Letters
Oblivious two-way finite automata: decidability and complexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Descriptional complexity of two-way pushdown automata with restricted head reversals
Theoretical Computer Science
Two-Way Reversible Multi-Head Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
P and dp automata: unconventional versus classical automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Inside the class of REGEX languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
States and heads do count for unary multi-head finite automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Finite state verifiers with constant randomness
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Automata with modulo counters and nondeterministic counter bounds
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Comparing two-dimensional one-marker automata to sgraffito automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Hi-index | 5.23 |
Multi-head finite automata were introduced and first investigated by Rabin and Scott in 1964 and Rosenberg in 1966. Since that time, a vast literature on computational and descriptional complexity issues on multi-head finite automata documenting the importance of these devices has been developed. Although multi-head finite automata are a simple concept, their computational behavior can be already very complex and leads to undecidable or even non-semi-decidable problems on these devices such as, for example, emptiness, finiteness, universality, equivalence, etc. Additionally the conversions between different types of multi-head finite automata induce in most cases size bounds that cannot be bounded by any recursive function, so-called non-recursive trade-offs. These strong negative results trigger the study of subclasses and alternative characterizations of multi-head finite automata for a better understanding of the nature of non-recursive trade-offs and, thus, the borderline between decidable and undecidable problems. In the present paper, we tour a fragment of this literature.