Automatic Functions, Linear Time and Learning

The present work determines the exact nature of linear time computable notions which characterise automatic functions (those whose graphs are recognised by a finite automaton). The paper also determines which type of linear time notions permit full learnability for learning in the limit of automatic classes (families of languages which are uniformly recognised by a finite automaton). In particular it is shown that a function is automatic iff there is a one-tape Turing machine with a left end which computes the function in linear time where the input before the computation and the output after the computation both start at the left end. It is known that learners realised as automatic update functions are restrictive for learning. In the present work it is shown that one can overcome the problem by providing work-tapes additional to a resource-bounded base tape while keeping the update-time to be linear in the length of the largest datum seen so far. In this model, one additional such worktape provides additional learning power over the automatic learner model and the two-work-tape model gives full learning power.

[1]  Carl H. Smith,et al.  On the impact of forgetting on learning machines , 1995, JACM.

[2]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

[3]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[4]  John Case,et al.  Automatic Learning of Subclasses of Pattern Languages , 2011, LATA.

[5]  Leonard Pitt,et al.  Inductive Inference, DFAs, and Computational Complexity , 1989, AII.

[6]  Juris Hartmanis Computational Complexity of One-Tape Turing Machine Computations , 1968, JACM.

[7]  Manuel Blum,et al.  Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..

[8]  Sanjay Jain,et al.  Learnability of automatic classes , 2012, J. Comput. Syst. Sci..

[9]  Dana Angluin,et al.  Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[10]  Daniel N. Osherson,et al.  Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .

[11]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[12]  Frank Stephan,et al.  Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity , 1995, Inf. Comput..

[13]  F. C. Hennie Crossing sequences and off-line Turing machine computations , 1965, SWCT.

[14]  Sanjay Jain,et al.  ON AUTOMATIC FAMILIES , 2011 .

[15]  P. Odifreddi The theory of functions and sets of natural numbers , 1989 .

[16]  Thomas Zeugmann,et al.  Learning indexed families of recursive languages from positive data: A survey , 2008, Theor. Comput. Sci..

[17]  P. Odifreddi Classical recursion theory , 1989 .