New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries

DOI10.1007/s00236-010-0130-7zbMath1234.68170OpenAlexW2075722229MaRDI QIDQ766158

Victor Mitrana, Cristina Tîrnăucă

Publication date: 23 March 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-010-0130-7

zbMATH Keywords

equivalence queriesDFA learninginjective degreeLCA algorithmMyhill-Nerode equivalence

Mathematics Subject Classification ID

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

Cites Work

• Learning regular sets from queries and counterexamples
• Inference of finite automata using homing sequences
• Linear Automaton Transformations

This page was built for publication: New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries