Learning DFA from Correction and Equivalence Queries
From MaRDI portal
Publication:3541870
DOI10.1007/11872436_23zbMath1158.68401MaRDI QIDQ3541870
Adrian Horia Dediu, Leonor Becerra-Bonache, Cristina Tîrnăucă
Publication date: 27 November 2008
Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11872436_23
Related Items
Learning definite Horn formulas from closure queries, One-shot learners using negative counterexamples and nearest positive examples, Necessary and sufficient conditions for learning with correction queries, Types of Trusted Information That Make DFA Identification with Correction Queries Feasible, One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples, Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries, On Learning Regular Expressions and Patterns Via Membership and Correction Queries, A Note on the Relationship between Different Types of Correction Queries, Learning Finite Automata Using Label Queries