Automatic learning of subclasses of pattern languages
From MaRDI portal
Publication:690501
DOI10.1016/J.IC.2012.07.001zbMATH Open1279.68139OpenAlexW2037750176MaRDI QIDQ690501FDOQ690501
Authors: John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, Frank Stephan 
Publication date: 27 November 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2012.07.001
Recommendations
- Automatic learning of subclasses of pattern languages
- Learning Subclasses of Pure Pattern Languages
- Learning subregular classes of languages with factored deterministic automata
- Case-based representation and learning of pattern languages
- Polynomial-time algorithms for learning typed pattern languages
- scientific article; zbMATH DE number 1453051
- Stochastic finite learning of the pattern languages
- A Language of Patterns for Subterm Selection
- scientific article; zbMATH DE number 1372649
- Learning pattern languages over groups
Cites Work
- Learning regular sets from queries and counterexamples
- Incremental learning from positive data
- Three lectures on automatic structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata Presenting Structures: A Survey of the Finite String Case
- Inductive inference of formal languages from positive data
- Title not available (Why is that?)
- Toward a mathematical theory of inductive inference
- STACS 2004
- Language identification in the limit
- Learning indexed families of recursive languages from positive data: A survey
- Finding patterns common to a set of strings
- An introduction to Kolmogorov complexity and its applications
- Inference of Reversible Languages
- Title not available (Why is that?)
- A non-learnable class of E-pattern languages
- Language learning from texts: Mindchanges, limited memory and monotonicity
- Robust learning of automatic classes of languages
- Polynomial-time inference of arbitrary pattern languages
- Identification of function distinguishable languages.
- Learnability of automatic classes
- On the impact of forgetting on learning machines
- Finite presentations of infinite structures: Automata and interpretations
- Uncountable automatic classes and learning
- Title not available (Why is that?)
- On automatic families
- Learning a subclass of regular patterns in polynomial time
Cited In (7)
- Automatic learning of subclasses of pattern languages
- Title not available (Why is that?)
- Learning pattern languages over groups
- Gold-style learning theory. A selection of highlights since Gold
- A Language of Patterns for Subterm Selection
- Learning Subclasses of Pure Pattern Languages
- Automatic learners with feedback queries
This page was built for publication: Automatic learning of subclasses of pattern languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690501)
