A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
An Efficient Algorithm for Learning Event-Recording Automata
[chapter]
2011
Lecture Notes in Computer Science
In inference of untimed regular languages, given an unknown language to be inferred, an automaton is constructed to accept the unknown language from answers to a set of membership queries each of which asks whether a string is contained in the unknown language. One of the most well-known regular inference algorithms is the L * algorithm, proposed by Angluin in 1987, which can learn a minimal deterministic finite automaton (DFA) to accept the unknown language. In this work, we propose an
doi:10.1007/978-3-642-24372-1_35
fatcat:vplzk3wufjcx5a4w6t5mnvuj6u