Learning deterministic DEC grammars is learning rational numbers

被引:0
|
作者
Adriaans, Pieter [1 ]
机构
[1] Univ Amsterdam, Dept Comp Sci, NL-1098 VA Amsterdam, Netherlands
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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]).
引用
收藏
页码:320 / 326
页数:7
相关论文
共 50 条