Weight-reducing Turing machines - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information and Computation Année : 2023

Weight-reducing Turing machines

Résumé

It is well known that one-tape Turing machines running in linear time are no more powerful than finite automata; namely they recognize exactly the class of regular languages. We prove that it is not decidable if a one-tape machine runs in linear time, even if it is deterministic and restricted to use only the portion of the tape that initially contains the input. This motivates the introduction of a constructive variant of one-tape machines, called a weight-reducing machine, and the investigation of its properties. We focus on the deterministic case. In particular, we show that, paying a polynomial size increase only, each weight-reducing machine can be turned into a halting one that runs in linear time. Furthermore each weight-reducing machine can be converted into equivalent nondeterministic and deterministic finite automata by paying an exponential and doublyexponential increase in size, respectively. These costs cannot be reduced in the worst case.
Fichier principal
Vignette du fichier
wrhm-part1.pdf (1.08 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY NC ND - Paternité - Pas d'utilisation commerciale - Pas de modification

Dates et versions

hal-04093540 , version 1 (10-05-2023)

Licence

Paternité - Pas d'utilisation commerciale - Pas de modification

Identifiants

Citer

Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Průša. Weight-reducing Turing machines. Information and Computation, 2023, 292, pp.105030. ⟨10.1016/j.ic.2023.105030⟩. ⟨hal-04093540⟩
20 Consultations
11 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More