John Case ; Sanjay Jain ; Frank Stephan ; Frank Stephan - Automatic functions, linear time and learning

lmcs:734 - Logical Methods in Computer Science, September 17, 2013, Volume 9, Issue 3 -
Automatic functions, linear time and learning

Authors: John Case ; Sanjay Jain ; Frank Stephan ; Frank Stephan

The present work determines the exact nature of {\em 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 work tape provides additional learning power over the automatic learner model and two additional work tapes give full learning power. Furthermore, one can also consider additional queues or additional stacks in place of additional work tapes and for these devices, one queue or two stacks are sufficient for full learning power while one stack is insufficient.

Volume: Volume 9, Issue 3
Published on: September 17, 2013
Accepted on: June 25, 2015
Submitted on: October 12, 2012
Keywords: Computer Science - Formal Languages and Automata Theory


Consultation statistics

This page has been seen 313 times.
This article's PDF has been downloaded 206 times.