A Formalisation of Finite Automata Using Hereditarily Finite Sets-Reference-Cited by-同舟云学术

A Formalisation of Finite Automata Using Hereditarily Finite Sets

Published:2015 Issue: Volume: Page:231-245
ISSN:0302-9743
Container-title:Automated Deduction - CADE-25
language:
Short-container-title:

Author:

Paulson Lawrence C.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-21401-6_15

Reference15 articles.

1. Ballarin, C.: Locales: A module system for mathematical theories. J. Autom. Reasoning 52(2), 123–153 (2014)

2. Braibant, T., Pous, D.: Deciding Kleene algebras in Coq. Log. Methods Comput. Sci. 8(1), 1–42 (2012)

3. Champarnaud, J., Khorsi, A., Paranthoën, T.: Split and join for minimizing: Brzozowski’s algorithm. In: Balík, M., Simánek, M. (eds.) The Prague Stringology Conference, pp. 96–104. Czech Technical University, Department of Computer Science and Engineering (2002)

4. Constable, R.L., Jackson, P.B., Naumov, P., Uribe, J.C.: Constructively formalizing automata theory. In: Plotkin, G.D., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction, pp. 213–238. MIT Press (2000)

5. Lecture Notes in Computer Science;C Doczkal,2013

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph Theory in Coq: Minors, Treewidth, and Isomorphisms;Journal of Automated Reasoning;2020-01-31

2. Regular Language Representations in the Constructive Type Theory of Coq;Journal of Automated Reasoning;2018-03-10

3. Formally Verified Algorithms for Upper-Bounding State Space Diameters;Journal of Automated Reasoning;2018-02-03

4. The verification of conversion algorithms between finite automata;Science China Information Sciences;2017-11-17

5. FORMAL LANGUAGES, FORMALLY AND COINDUCTIVELY;LOG METH COMPUT SCI;2017