On n-type finite state acceptors
SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
Journal of the ACM (JACM)
State and Transition Complexity of Watson-Crick Finite Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On the Computational Capacity of Parallel Communicating Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the descriptional complexity of Watson-Crick automata
Theoretical Computer Science
On stateless multihead automata: Hierarchies and the emptiness problem
Theoretical Computer Science
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
Multitape one-way nonwriting automata
Journal of Computer and System Sciences
On stateless multihead automata: hierarchies and the emptiness problem
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Parallel Turing machines on four-dimensional input tapes
Artificial Life and Robotics
Undecidability and hierarchy results for parallel communicating finite automata
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
One-reversal counter machines and multihead automata: revisited
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
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
A Perfect Model for Bounded Verification
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Two-Way Reversible Multi-Head Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
States and heads do count for unary multi-head finite automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
One-reversal counter machines and multihead automata: Revisited
Theoretical Computer Science
| Hi-index | 0.01 |
Let Mn, be the class of languages defined by n-head finite automata. The Boolean and Kleene closure properties of Mn, are investigated, and a relationship between Mn, and the class of sets of n-tuples of tapes defined by n-tape finite automata is established. It is shown that the classes Mi form a hierarchy; and that, moreover, for all n, there is a context-free language (CFL) in Mn+1, - Mn. It is further shown that there is a CFL which is in no Mn for any integer n. Finally, several decision properties of the multi-head languages are established.