Learning deterministic DEC grammars is learning rational numbers

Authors:
Pieter Adriaans
Affiliations:
Department of Computer Science, University of Amsterdam, Amsterdam
Venue:
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Year:
2006

Citing 4
Cited 1

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
&ohgr;-languages

Handbook of formal languages, vol. 3
Learning of Regular Bi-omega Languages

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Inference of W-languages from prefixes

Theoretical Computer Science - Special issue: Algorithmic learning theory

Learning as Data Compression

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World

Quantified Score

Hi-index	0.00

Visualization

Abstract

Below I show that the class of strings that can be learned by a deterministic DEC grammar is exactly the class of rational numbers between 0 and 1. I call this the class of semi-periodic or rational strings. Dynamically Expanding Context (Dec) grammars were introduced by Kohonen in order to model speech signals ([8]). They can be learned in quadratic time in the size of the grammar. They have been used successfully in the automatic generation and analysis of music ([7],[5],[6]).