Uncountable automatic classes and learning

DOI10.1016/J.TCS.2010.12.057zbMATH Open1222.68108OpenAlexW2104868629MaRDI QIDQ2431428FDOQ2431428

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

Publication date: 14 April 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.057

Recommendations

• Uncountable automatic classes and learning
• Learnability of automatic classes
• Learnability of automatic classes
• On the learnability of infinitary regular sets
• Polynomial identification of \(\omega \)-automata

zbMATH Keywords

learning theoryinductive inferenceautomatic classesuncountable classes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Automatic learning of subclasses of pattern languages
• Uncountable automatic classes and learning
• Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
• Automatic learners with feedback queries

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 Q2431428)