Learnability of automatic classes

DOI10.1016/J.JCSS.2011.12.011zbMath1250.68137OpenAlexW2027870825MaRDI QIDQ1757849

Sanjay Jain, Frank Stephan, Qinglong Luo

Publication date: 6 November 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.12.011

zbMATH Keywords

inductive inferenceautomatic structures

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (11)

Second-order finite automata: expressive power and simple proofs using automatic structures ⋮ Robust learning of automatic classes of languages ⋮ Automatic learners with feedback queries ⋮ Parallel learning of automatic classes of languages ⋮ Second-order finite automata ⋮ Learning pattern languages over groups ⋮ Learning from Positive Data and Negative Counterexamples: A Survey ⋮ Randomness of formal languages via automatic martingales ⋮ Automatic learning from positive data and negative counterexamples ⋮ Learners based on transducers ⋮ Uncountable Automatic Classes and Learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonic and non-monotonic inductive inference
• Polynomial-time inference of arbitrary pattern languages
• Learning regular sets from queries and counterexamples
• Finding patterns common to a set of strings
• On direct products of automaton decidable theories
• Learning regular languages from counterexamples
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• Identification of function distinguishable languages.
• Finite presentations of infinite structures: Automata and interpretations
• Characterizations of monotonic and dual monotonic language learning
• Language learning from texts: Mindchanges, limited memory and monotonicity
• Automatic Learning of Subclasses of Pattern Languages
• Automatic Learners with Feedback Queries
• Learning strategies
• Automata Presenting Structures: A Survey of the Finite String Case
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• Toward a mathematical theory of inductive inference
• Inductive inference of automata, functions and programs
• The Power of Vacillation in Language Learning
• On the impact of forgetting on learning machines
• STACS 2004
• Language identification in the limit
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

This page was built for publication: Learnability of automatic classes