Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

The verification of conversion algorithms between finite automata

  • 36 Accesses

  • 1 Citations

This is a preview of subscription content, log in to check access.

References

  1. 1

    Filliâtre J C. Finite Auotmata Theory in Coq: a Constructive Proof of Kleene’s Theorem. Research Report 97 C 04, LIP-ENS Lyon. 1997

  2. 2

    Braibant T, Pous D. An efficient Coq tactic for deciding Kleene algebras. In: Proceedings of International Conference on Interactive Theorem Proving, Edinburgh, 2010. 163–178

  3. 3

    Lammich P, Tuerk T. Applying data refinement for monadic programs to Hopcroft’s algorithm. In: Proceedings of International Conference on Interactive Theorem Proving, New Jersey, 2012. 166–182

  4. 4

    Paulson L C. A Formalisation of finite automata using hereditarily finite sets. In: Proceedings of CADE-25-International Conference on Automated Deduction, Berlin, 2015. 231–245

  5. 5

    Lammich P, Lochbihler A. The isabelle collections framework. In: Proceedings of International Conference on Interactive Theorem Proving, New Jersey, 2010. 339–354

  6. 6

    Esparza J. Automata Theory: an Algorithmic Approach. 2016. https://www7.in.tum.de/~esparza/autoskript.pdf

Download references

Acknowledgements

This work was supported by Beijing Natural Science Foundation (Grant No. 4164092) and Fundamental Research Funds for Central Universities (Grant No. BLX2015-17).

Author information

Correspondence to Dongchen Jiang.

Additional information

The authors declare that they have no conflict of interest.

The Verification of Conversion Algorithms between Finite Automata

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Jiang, D., Li, W. The verification of conversion algorithms between finite automata. Sci. China Inf. Sci. 61, 028101 (2018). https://doi.org/10.1007/s11432-017-9155-x

Download citation