Types of Trusted Information That Make DFA Identification with Correction Queries Feasible

DOI10.1007/978-3-642-18098-9_29zbMath1297.68099OpenAlexW2226936361MaRDI QIDQ3073646

Cătălin Ionuţ Tîrnăucă, Cristina Tîrnăucă

Publication date: 11 February 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_29

zbMATH Keywords

deterministic finite automatoncorrection queryinjectivity degree

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Teaching a smarter learner.
• Learning regular sets from queries and counterexamples
• Learning DFA from Correction and Equivalence Queries
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets
• A note on the number of queries needed to identify regular languages
• Language identification in the limit

This page was built for publication: Types of Trusted Information That Make DFA Identification with Correction Queries Feasible