In 1978 Sakoda and Sipser raised the question of the cost, in terms of size of representations, of the transformation of two-way and one-way nondeterministic automata into equivalent two-way deterministic automata. Despite all the attempts, the question has been answered only for particular cases (e.g., restrictions of the class of simulated automata or of the class of simulating automata). However the problem remains open in the general case, the best-known upper bound being exponential. We present a new approach in which unrestricted nondeterministic finite automata are simulated by deterministic models extending two-way deterministic finite automata, paying a polynomial increase of size only. Indeed, we study the costs of the conversions of nondeterministic finite automata into some variants of one-tape deterministic Turing machines working in linear time, namely Hennie machines, weight-reducing Turing machines, and weight-reducing Hennie machines. All these variants are known to share the same computational power: they characterize the class of regular languages.

Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines / B. Guillon, G. Pighizzini, L. Prigioniero, D. Průša. - (2021).

Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines

Giovanni Pighizzini;Luca Prigioniero;
2021

Abstract

In 1978 Sakoda and Sipser raised the question of the cost, in terms of size of representations, of the transformation of two-way and one-way nondeterministic automata into equivalent two-way deterministic automata. Despite all the attempts, the question has been answered only for particular cases (e.g., restrictions of the class of simulated automata or of the class of simulating automata). However the problem remains open in the general case, the best-known upper bound being exponential. We present a new approach in which unrestricted nondeterministic finite automata are simulated by deterministic models extending two-way deterministic finite automata, paying a polynomial increase of size only. Indeed, we study the costs of the conversions of nondeterministic finite automata into some variants of one-tape deterministic Turing machines working in linear time, namely Hennie machines, weight-reducing Turing machines, and weight-reducing Hennie machines. All these variants are known to share the same computational power: they characterize the class of regular languages.
cs.FL; cs.FL; 68Q45; F.4.3; F.1.1
Settore INF/01 - Informatica
http://arxiv.org/abs/2103.05485v2
File in questo prodotto:
File Dimensione Formato  
2103.05485.pdf

accesso aperto

Tipologia: Pre-print (manoscritto inviato all'editore)
Dimensione 619.63 kB
Formato Adobe PDF
619.63 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2434/921530
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact