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.
Cite
CITATION STYLE
Guillon, B., & Prigioniero, L. (2018). Linear-time limited automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10952 LNCS, pp. 126–138). Springer Verlag. https://doi.org/10.1007/978-3-319-94631-3_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
