Skip to Main content Skip to Navigation
Conference papers

Linear-Time Limited Automata

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, October 26, 2018 - 8:01:22 AM
Last modification on : Wednesday, December 8, 2021 - 9:22:07 AM
Long-term archiving on: : Sunday, January 27, 2019 - 12:59:40 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads