Inductive inference of unbounded unions of pattern languages from positive data

DOI10.1007/3-540-61863-5_51MaRDI QIDQ5900846zbMATH OpenOpenAlexFDO

Authors Takeshi Shinohara, Hiroki Arimura

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

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

Recommendations

• Inductive inference of unbounded unions of pattern languages from positive data
• scientific article; zbMATH DE number 2149593
• Implementation and Application of Automata
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data

Cited in

(21)

• Learning pattern languages over groups
• Incremental concept learning for bounded data mining.
• Decision lists over regular patterns.
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• Learning pattern languages over groups
• Inferring uniquely terminating regular languages from positive data
• scientific article; zbMATH DE number 996381 (Why is no real title available?)
• Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
• Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses
• scientific article; zbMATH DE number 1966624 (Why is no real title available?)
• scientific article; zbMATH DE number 1966625 (Why is no real title available?)
• scientific article; zbMATH DE number 2143051 (Why is no real title available?)
• scientific article; zbMATH DE number 2149593 (Why is no real title available?)
• Algorithmic Learning Theory
• Implementation and Application of Automata
• Inductive inference of unbounded unions of pattern languages from positive data
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
• Discovering unbounded unions of regular pattern languages from positive examples
• From learning in the limit to stochastic finite learning
• Developments from enquiries into the learnability of the pattern languages from positive data
• Discontinuities in pattern inference

This page was built for publication: Inductive inference of unbounded unions of pattern languages from positive data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900846)