Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Refining nondeterminism below linear time
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Finding patterns common to a set of strings (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Complementing deterministic tree-walking automata
Information Processing Letters
Complementing two-way finite automata
Information and Computation
Finite automata and their decision problems
IBM Journal of Research and Development
IBM Journal of Research and Development
On tape-bounded complexity classes and multihead finite automata
Journal of Computer and System Sciences
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
| Hi-index | 0.89 |
In this work, we consider deterministic two-way multi-head automata, the input heads of which are nondeterministically initialised, i.e., in every computation each input head is initially located at some nondeterministically chosen position of the input word. This model serves as an instrument to investigate restricted nondeterminism of two-way multi-head automata. Our result is that, in terms of expressive power, two-way multi-head automata with nondeterminism in form of nondeterministically initialising the input heads or with restricted nondeterminism in the classical way, i.e., in every accepting computation the number of nondeterministic steps is bounded by a constant, do not yield an advantage over their completely deterministic counter-parts with the same number of input heads. We conclude this paper with a brief application of this result.