Uncountable automatic classes and learning
From MaRDI portal
Publication:2431428
DOI10.1016/j.tcs.2010.12.057zbMath1222.68108OpenAlexW2104868629MaRDI QIDQ2431428
Qinglong Luo, Sanjay Jain, 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
Related Items (3)
Automatic learners with feedback queries ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Automatic learning of subclasses of pattern languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite presentations of infinite structures: Automata and interpretations
- Weak Second‐Order Arithmetic and Finite Automata
- Learnability of Automatic Classes
- The Büchi Complementation Saga
- Inductive inference of formal languages from positive data
- The Power of Vacillation in Language Learning
- Language identification in the limit
- Automata theory and its applications
This page was built for publication: Uncountable automatic classes and learning