Learning Regular Omega Languages

DOI10.1007/978-3-319-11662-4_10zbMath1353.68149OpenAlexW179423627MaRDI QIDQ2938728

Dana Angluin, Dana Fisman

Publication date: 14 January 2015

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-11662-4_10

Mathematics Subject Classification ID

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

Related Items

Learning infinite-word automata with loop-index queries, Prediction of infinite words with automata, Learning regular omega languages, Inferring regular languages and \(\omega\)-languages, Learning and characterizing fully-ordered lattice automata, Unnamed Item, Concurrent Kleene algebra with observations: from hypotheses to completeness, Unnamed Item, A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees, Polynomial Identification of $$\omega $$-Automata, Regular \(\omega\)-languages with an informative right congruence, Unnamed Item