Weight-reducing Turing machines - Archive ouverte HAL Access content directly
Journal Articles Information and Computation Year : 2023

Weight-reducing Turing machines


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.
Embargoed file
Embargoed file
0 5 9
Year Month Jours
Avant la publication

Dates and versions

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


Attribution - NonCommercial - NoDerivatives - CC BY 4.0



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⟩
0 View
0 Download



Gmail Facebook Twitter LinkedIn More