Learning Behaviors of Automata from Multiplicity and Equivalence Queries

DOI10.1137/S009753979326091XzbMath0864.68063MaRDI QIDQ5691294

Stefano Varricchio, Francesco Bergadano

Publication date: 28 January 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

identificationPAC-learning\(Q\)-automatonunambiguous nondeterministic automata

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (19)

Learning of Structurally Unambiguous Probabilistic Grammars ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Inferring regular languages and \(\omega\)-languages ⋮ Learning Weighted Automata ⋮ A simple algorithm for learning O(log n)-term DNF ⋮ Almost optimal proper learning and testing polynomials ⋮ Inferring Symbolic Automata ⋮ Representing regular languages of infinite words using mod 2 multiplicity automata ⋮ Learning quantum finite automata with queries ⋮ Learning weighted automata over principal ideal domains ⋮ Unnamed Item ⋮ Unnamed Item ⋮ \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition ⋮ \(L^\ast\)-based learning of Markov decision processes (extended version) ⋮ Learning expressions and programs over monoids ⋮ Stefano Varricchio (1960-2008) ⋮ Regular \(\omega\)-languages with an informative right congruence ⋮ An Algebraic Perspective on Boolean Function Learning ⋮ A categorical framework for learning generalised tree automata

This page was built for publication: Learning Behaviors of Automata from Multiplicity and Equivalence Queries