Efficient Inference of Mealy Machines

@inproceedings{Heerdt2014EfficientIO,
  title={Efficient Inference of Mealy Machines},
  author={Gerco van Heerdt},
  year={2014}
}
Automata learning is increasingly being applied to ease the testing and comparing of complex systems. We formally reconstruct an efficient algorithm for the inference of Mealy machines, prove its correctness, and show that equivalence queries are not required for nonminimal hypotheses. In fact, we are able to evade those by applying a minor optimization to the algorithm. As a corollary, standard conformance testing methods can be used directly for equivalence query approximations within this… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Inferring Mealy Machines

View 6 Excerpts
Highly Influenced

Algorithms for Learning Finite Automata from Queries: A Unified View

Advances in Algorithms, Languages, and Complexity • 1997
View 4 Excerpts
Highly Influenced

Learning Regular Sets from Queries and Counterexamples

Inf. Comput. • 1987
View 10 Excerpts
Highly Influenced

On the Learnability of Infinitary Regular Sets

COLT • 1991
View 5 Excerpts
Highly Influenced

Linear automaton transformations

A. Nerode
Proceedings of the American Mathematical Society, • 1958
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…