Learning DFA from Correction and Equivalence Queries-Reference-Cited by-同舟云学术

Learning DFA from Correction and Equivalence Queries

Published:2006 Issue: Volume: Page:281-292
ISSN:0302-9743
Container-title:Grammatical Inference: Algorithms and Applications
language:
Short-container-title:

Author:

Becerra-Bonache Leonor,Dediu Adrian Horia,Tîrnăucă Cristina

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11872436_23.pdf

Reference7 articles.

1. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)

2. Becerra-Bonache, L.: On the Learnability of Mildly Context-Sensitive Languages using Positive Data and Correction Queries. Doctoral thesis, Rovira i Virgili University (2006)

3. LNAI;L. Becerra-Bonache,2004

4. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (2001)

5. Studies in Fuzzyness and Soft Computing 148;S. Yu,2004

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Unified Analysis of Dynamic Interactive Learning;2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton);2023-09-26

2. IDLIQ: An Incremental Deterministic Finite Automaton Learning Algorithm Through Inverse Queries for Regular Grammar Inference;Big Data;2023-05-18

3. A Reinforcement Learning Based Grammatical Inference Algorithm Using Block-Based Delta Inverse Strategy;IEEE Access;2023

4. An Interactive Search Game with Two Agents;2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton);2022-09-27

5. Membership Algorithm for Single-Occurrence Regular Expressions with Shuffle and Counting;Database Systems for Advanced Applications;2022