Linear-Time Limited Automata

Bruno Guillon (1) , Luca Prigioniero (1)

1 UNIMI - Università degli Studi di Milano = University of Milan

The time complexity of 1-limited automata is investigated from a descriptional complexity view point. Though the model recognizes regular languages only, it may use quadratic time in the input length. We show that, with a polynomial increase in size and preserving determinism, each 1-limited automaton can be transformed into an halting linear-time equivalent one. We also obtain polynomial transformations into related models, including weight-reducing Hennie machines, and we show exponential gaps for converse transformations in the deterministic case.

Domaines: Informatique [cs]

Bruno Guillon, Luca Prigioniero. Linear-Time Limited Automata. 20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.126-138, ⟨10.1007/978-3-319-94631-3_11⟩. ⟨hal-01905632⟩