Automatic learning of subclasses of pattern languages
From MaRDI portal
Publication:690501
DOI10.1016/j.ic.2012.07.001zbMath1279.68139OpenAlexW2037750176MaRDI QIDQ690501
John Case, Frank Stephan, Yuh Shin Ong, Trong Dao Le, Sanjay Jain, Pavel Semukhin
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
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time inference of arbitrary pattern languages
- A non-learnable class of E-pattern languages
- Learning a subclass of regular patterns in polynomial time
- Learning indexed families of recursive languages from positive data: A survey
- Learning regular sets from queries and counterexamples
- Finding patterns common to a set of strings
- Identification of function distinguishable languages.
- Finite presentations of infinite structures: Automata and interpretations
- Incremental learning from positive data
- Language learning from texts: Mindchanges, limited memory and monotonicity
- Uncountable automatic classes and learning
- Three Lectures on Automatic Structures
- Robust Learning of Automatic Classes of Languages
- Automata Presenting Structures: A Survey of the Finite String Case
- Learnability of Automatic Classes
- Inductive inference of formal languages from positive data
- Inference of Reversible Languages
- Toward a mathematical theory of inductive inference
- On the impact of forgetting on learning machines
- ON AUTOMATIC FAMILIES
- STACS 2004
- Language identification in the limit
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: Automatic learning of subclasses of pattern languages
