Journal article

Publication year: 2014

Pages: 294-302

Journal: Information and Computation

Volume number: 237

ISSN: 0890-5401

eISSN: 1090-2651

Open access status: Bronze

DOI Link: https://doi.org/10.1016/j.ic.2014.04.001

Publisher: Elsevier

Abstract: 
We investigate the descriptional complexity and decidability of obliviousness for two-way finite automata. In particular, we consider the simulation of two-way deterministic finite automata (2DFAs) by oblivious 2DFAs, the simulation of oblivious 2DFAs by sweeping 2DFAs and one-way nondeterministic finite automata (1NFAs) as well as the simulation of sweeping 2DFAs by 1NFAs. In all cases exponential lower bounds on the number of states are obtained for languages over an alphabet with at most four letters. Finally, a procedure for deciding obliviousness of an arbitrary 2DFA is given and, moreover, the problem is shown to be PSPACE-complete. (C) 2014 Elsevier Inc. All rights reserved.

Harvard Citation style: Kutrib, M., Malcher, A. and Pighizzini, G. (2014) Oblivious two-way finite automata: Decidability and complexity, Information and Computation, 237, pp. 294-302. https://doi.org/10.1016/j.ic.2014.04.001

APA Citation style: Kutrib, M., Malcher, A., & Pighizzini, G. (2014). Oblivious two-way finite automata: Decidability and complexity. Information and Computation. 237, 294-302. https://doi.org/10.1016/j.ic.2014.04.001