Reidenbach_Schmid_IPL_112.pdf (280.76 kB)
On multi-head automata with restricted nondeterminism
journal contribution
posted on 2012-05-25, 10:39 authored by Daniel Reidenbach, Markus L. SchmidIn this work, we consider deterministic two-way multi-headautomata, 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 restrictednondeterminism of two-way multi-headautomata. Our result is that, in terms of expressive power, two-way multi-headautomata with nondeterminism in form of nondeterministically initialising the input heads or with restrictednondeterminism 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.
History
School
- Science
Department
- Computer Science
Citation
REIDENBACH, D. and SCHMID, M.L., 2012. On multi-head automata with restricted nondeterminism. Information Processing Letters, 112 (14-15), pp. 572 - 577Publisher
© ElsevierVersion
- AM (Accepted Manuscript)
Publication date
2012Notes
This article was published in the journal, Information Processing Letters [© Elsevier] and the definitive version is available at: http://dx.doi.org/10.1016/j.ipl.2012.04.009ISSN
0020-0190Publisher version
Language
- en