Inductive inference of unbounded unions of pattern languages from positive data
From MaRDI portal
Publication:5900846
DOI10.1007/3-540-61863-5_51zbMath1184.68294MaRDI QIDQ5900846
Hiroki Arimura, Takeshi Shinohara
Publication date: 27 April 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61863-5_51
68Q32: Computational learning theory
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
Related Items
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries, From learning in the limit to stochastic finite learning, Incremental concept learning for bounded data mining., Decision lists over regular patterns.