Automatic Learning from Repetitive Texts


Rupert Hölzl, Sanjay Jain, Philipp Schlicht, Karen Seidel, Frank Stephan ;
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:129-150, 2017.


We study the connections between the learnability of automatic families of languages and the types of text used to present them to a learner. More precisely, we study how restrictions on the number of times that a correct datum appears in a text influence what classes of languages are automatically learnable. We show that an automatic family of languages is automatically learnable from fat text iff it is automatically learnable from thick text iff it is verifiable from balanced text iff it satisfies Angluin's tell-tale condition. Furthermore, many automatic families are automatically learnable from exponential text. We also study the relationship between automatic learnability and verifiability and show that all automatic families are automatically partially verifiable from exponential text and automatically learnable from thick text.

Related Material