From k + 1 to k heads the descriptive trade-off is non-recursive

We prove that no recursive function can upper bound the increase in the size of description when a two-way deterministic finite automaton with k + 1 heads is replaced by an equivalent two-way deterministic finite automaton with k heads. This is true for all k, and remains true if the automata are unary and/or nondeterministic.

[1]  Andreas Malcher.  Descriptional Complexity of Cellular Automata and Decidability Questions , 2001, DCFS.

[2]  Hao Wang,et al.  A Variant to Turing's Theory of Computing Machines , 1957, JACM.

[3]  Frederick N. Springsteel,et al.  Language Recognition by Marking Automata , 1972, Inf. Control..

[4]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[5]  R. E. Sm.  A Regularity Test for Pushdown Machines , 2004 .

[6]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[7]  Burkhard Monien,et al.  Transformational methods and their application to complexity problems , 1976, Acta Informatica.

[8]  John C. Shepherdson,et al.  The Reduction of Two-Way Automata to One-Way Automata , 1959, IBM J. Res. Dev..

[9]  Andreas Malcher,et al.  Descriptional Complexity of Machines with Limited Resources , 2002, J. Univers. Comput. Sci..

[10]  Burkhard Monien.  Two-Way Multihead Automata Over a One-Letter Alphabet , 1980, RAIRO Theor. Informatics Appl..

[11]  Juris Hartmanis.  On the Succinctness of Different Representations of Languages , 1980, SIAM J. Comput..

[12]  A. R. Meyer,et al.  Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[13]  Martin Kutrib.  On the descriptional power of heads, counters, and pebbles , 2005, Theor. Comput. Sci..

[14]  Erik Meineche Schmidt,et al.  Succinctness of Descriptions of Unambiguous Context-Free Languages , 1977, SIAM J. Comput..

[15]  Burkhard Monien.  Transformational methods and their application to complexity problems , 1976, Acta Informatica.

[16]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[17]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[18]  Juris Hartmanis.  On non-determinancy in simple computing devices , 2004, Acta Informatica.

[19]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[20]  Leslie G. Valiant,et al.  A Note on the Succinctness of Descriptions of Deterministic Languages , 1976, Inf. Control..