Skip to main content
SpringerLink
Log in

The verification of conversion algorithms between finite automata

  • Highlight
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  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

    Google Scholar 

  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

    MATH  Google Scholar 

  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

    MATH  Google Scholar 

  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

    MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

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

Authors and Affiliations

  1. School of Information Science & Technology, Beijing Forestry University, Beijing, 100083, China

    Dongchen Jiang

  2. State Key Laboratory of Software Development Environment, Beihang University, Beijing, 100191, China

    Wei Li

Authors
  1. Dongchen Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

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

Check for updates. 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

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-017-9155-x

Search

Navigation