Parallel learning of automatic classes of languages

DOI10.1016/j.tcs.2016.07.029zbMath1362.68120OpenAlexW4207010233MaRDI QIDQ329605

Sanjay Jain, E. B. Kinber

Publication date: 21 October 2016

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

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

zbMATH Keywords

finite automatainductive inferenceautomatic classesfinite learninglearning in the limitparallel learningpositive data

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Frequency computation and bounded queries
• On the power of probabilistic strategies in inductive inference
• Training sequences
• Prudence and other conditions on formal language learning
• Learnability of automatic classes
• Regular frequency computations
• On learning multiple concepts in parallel
• Probabilistic inductive inference
• Inductive inference of formal languages from positive data
• The Power of Pluralism for Automatic Program Synthesis
• Toward a mathematical theory of inductive inference
• On Representatives of Subsets
• Language identification in the limit

This page was built for publication: Parallel learning of automatic classes of languages