Learning Finite Variants of Single Languages from Informant

DOI10.1007/978-3-319-46379-7_11zbMath1478.68108OpenAlexW2521575895MaRDI QIDQ2830274

Ambos-Spies, Klaus

Publication date: 9 November 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-46379-7_11

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completely mitotic r. e. degrees
• Inductive inference of formal languages from positive data
• A Completely Mitotic Nonrecursive R.E. Degree
• Toward a mathematical theory of inductive inference
• Mitotic recursively enumerable sets
• Language identification in the limit

This page was built for publication: Learning Finite Variants of Single Languages from Informant