Learning finite automata using label queries

DOI10.1007/978-3-642-04414-4_17MaRDI QIDQ3648751zbMATH OpenOpenAlexFDO

Authors Dana Angluin, Leonor Becerra-Bonache, Adrian Horia Dediu, Lev Reyzin

Publication date 1 December 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-04414-4_17

Mathematics Subject Classification ID

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

Recommendations

• Efficient learning of typical finite automata from random walks
• Publication:4247004
• Publication:4336266
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• Learning probabilistic automata and Markov chains via queries

Cites work

• scientific article; zbMATH DE number 3427224 (Why is no real title available?)
• scientific article; zbMATH DE number 2068873 (Why is no real title available?)
• A note on the number of queries needed to identify regular languages
• Efficient learning of typical finite automata from random walks
• Learning DFA from Correction and Equivalence Queries

Cited in

(4)

• Learning infinite-word automata with loop-index queries
• Natural language processing, moving from rules to data
• Enhancing Automata Learning by Log-Based Metrics
• Diameter and stationary distribution of random \(r\)-out digraphs

This page was built for publication: Learning finite automata using label queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648751)