Uncountable automatic classes and learning

DOI10.1007/978-3-642-04414-4_25MaRDI QIDQ3648759zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, Qinglong Luo, Pavel Semukhin, Frank Stephan

Publication date 1 December 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04414-4_25

Mathematics Subject Classification ID

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

Recommendations

• Uncountable automatic classes and learning
• Automatic learning of subclasses of pattern languages
• Learnability of automatic classes
• Learnability of automatic classes
• On the learnability of infinitary regular sets

Cites work

• Automata theory and its applications
• Cardinality and counting quantifiers on omega-automatic structures
• Finite presentations of infinite structures: Automata and interpretations
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learnability of automatic classes
• The Büchi Complementation Saga
• The Power of Vacillation in Language Learning
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(2)

• Uncountable automatic classes and learning
• Inferring descriptive generalisations of formal languages

This page was built for publication: Uncountable automatic classes and learning

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