, Doing so, the resulting 1-la is halting, has polynomial size with respect to A, and works in linear time, By analogy to Corollary, vol.1

, For each 1-la, there exists an equivalent weight-reducing Hennie machine or halting 2nfa+cg of polynomial size. This last result is of particular interest. Indeed, 2nfa+cg's are particular cases of 1-las

M. Daviaud, L. Guillon, B. Penelle, and V. , Which classes of origin graphs are generated by transducers, gives a kind of normal form for nondeterministic 1-las. References 1. Boja«czyk, vol.80, p.113, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01762979

V. Geert, C. Mereghetti, and G. Pighizzini, Complementing two-way nite automata, Inf. Comput, vol.205, issue.8, p.11731187, 2007.

F. C. Hennie, One-tape, o-line Turing machine computations, Information and Control, vol.8, issue.6, p.553578, 1965.

T. N. Hibbard, A generalization of context-free determinism, Information and Control, vol.11, issue.1/2, p.196238, 1967.

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 1979.

C. A. Kapoutsis, Predicate Characterizations in the Polynomial-Size Hierarchy, Conference on Computability in Europe, p.234244, 2014.

M. Kutrib, G. Pighizzini, and M. Wendlandt, Descriptional complexity of limited automata, Inf. Comput, vol.259, issue.2, p.259276, 2018.

G. Pighizzini, Nondeterministic one-tape o-line Turing machines, Languages and Combinatorics, vol.14, issue.1, p.107124, 2009.

G. Pighizzini and A. Pisoni, Limited automata and regular languages, International Journal of Foundations of Computer Science, vol.25, issue.07, p.897916, 2014.

G. Pighizzini and A. Pisoni, Limited automata and context-free languages, Fundamenta Informaticae, vol.136, issue.1-2, p.157176, 2015.

G. Pighizzini and L. Prigioniero, Limited automata and unary languages, DLT 2017, vol.10396, p.308319, 2017.

D. Pr·²a, Weight-reducing Hennie machines and their descriptional complexity, LATA 2014, vol.8370, p.553564, 2014.

J. C. Shepherdson, The reduction of two-way automata to one-way automata, IBM J. Res. Dev, vol.3, issue.2, p.198200, 1959.

M. Sipser, Halting space-bounded computations, Theoretical Computer Science, vol.10, issue.3, p.338, 1980.

K. Tadaki, T. Yamakami, and J. C. Lin, Theory of one-tape linear-time Turing machines, Theor. Comput. Sci, vol.411, issue.1, p.2243, 2010.

K. W. Wagner and G. Wechsung, , 1986.