The question of the state-size cost for simulation of two-way nondeterministic automata (2 nfas) by two-way deterministic automata (2 dfas) was raised in 1978 and, despite many attempts, it is still open. Subsequently, the problem was attacked by restricting the power of 2 dfas (e.g., using a restricted input head movement) to the degree for which it was already possible to derive some exponential gaps between the weaker model and the standard 2 nfas. Here we use an opposite approach, increasing the power of 2 dfas to the degree for which it is still possible to obtain a subexponential conversion from the stronger model to the standard 2 dfas. In particular, it turns out that subexponential conversion is possible for two-way automata that make nondeterministic choices only when the input head scans one of the input tape endmarkers. However, there is no restriction on the input head movement. This implies that an exponential gap between 2 nfas and 2 dfas can be obtained only for unrestricted 2 nfas using capabilities beyond the proposed new model. As an additional bonus, conversion into a machine for the complement of the original language is polynomial in this model. The same holds for making such machines self-verifying, halting, or unambiguous. Finally, any superpolynomial lower bound for the simulation of such machines by standard 2 dfas would imply L ≠ NL. In the same way, the alternating version of these machines is related to L over(=, ?) NL over(=, ?) P, the classical computational complexity problems. © 2014 Elsevier Inc. All rights reserved.
|Titolo:||Two-way automata making choices only at the endmarkers|
PIGHIZZINI, GIOVANNI (Corresponding)
|Parole Chiave:||Descriptional complexity ; Regular languages ; Two-way automata ; Theoretical Computer Science|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||dic-2014|
|Digital Object Identifier (DOI):||10.1016/j.ic.2014.08.009|
|Appare nelle tipologie:||01 - Articolo su periodico|