Paper Info
Title
A Learning Algorithm for Deterministic Finite Automata using JFLAP
Abstract
The JFLAP package is a free, interactive visualization, and teaching tool for formal languages. JFLAP is based on the principle that a picture of a concept can be easier to understand than a textual representation. With the help of this package, we implement Dana Angluin's algorithm which is able to learn Deterministic Finite Automata. The use of JFLAP allows users to visualize each step in the process of learning. The protocol used by the algorithm is called exact learning from membership and equivalence queries. This protocol was also introduced by Dana Angluin, who showed that her learning algorithm discovers the unique minimum automaton coherent with the queries in an efficient running time.
Year
DOI
Venue
2009
10.1016/j.entcs.2009.07.058
Electr. Notes Theor. Comput. Sci.
Keywords
Field
DocType
exact learning model,learning algorithm,exact learning,teaching tool,textual representation,dana angluin,deterministic finite automata,interactive visualization,formal language,equivalence query,jflap package,jflap
Textual representation,Formal language,Programming language,Computer science,Deterministic finite automaton,Automaton,Algorithm,Theoretical computer science,Equivalence (measure theory),Interactive visualization
Journal
Volume
ISSN
Citations 
248,
Electronic Notes in Theoretical Computer Science
0
PageRank 
References 
Authors
0.34
2
2
Name
Order
Citations
PageRank
Mikel Alecha100.34
Montserrat Hermo25510.77