Learning Finite Automata Using Label Queries

DOI10.1007/978-3-642-04414-4_17zbMath1262.68058OpenAlexW94998075MaRDI QIDQ3648751

Dana Angluin, Adrian Horia Dediu, Leonor Becerra-Bonache, 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

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

Related Items (2)

Natural Language Processing, Moving from Rules to Data ⋮ Diameter and stationary distribution of random \(r\)-out digraphs

Cites Work

• Efficient learning of typical finite automata from random walks
• Learning DFA from Correction and Equivalence Queries
• A note on the number of queries needed to identify regular languages
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning Finite Automata Using Label Queries