Inductive inference of unbounded unions of pattern languages from positive data

DOI10.1007/3-540-61863-5_51zbMath1184.68294OpenAlexW4239459698MaRDI 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

Mathematics Subject Classification ID

Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items

Decision lists over regular patterns. ⋮ From learning in the limit to stochastic finite learning ⋮ Learning pattern languages over groups ⋮ Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries ⋮ Learning Pattern Languages over Groups ⋮ Incremental concept learning for bounded data mining.