Finite Automata HF
From MaRDI portal
Software:40964
swMATH29250MaRDI QIDQ40964FDOQ40964
Author name not available (Why is that?)
Cited In (6)
- Graph theory in Coq: minors, treewidth, and isomorphisms
- Hereditarily Finite Sets in Constructive Type Theory
- A Formalisation of Finite Automata Using Hereditarily Finite Sets
- Formally verified algorithms for upper-bounding state space diameters
- Regular language representations in the constructive type theory of Coq
- Two-Way Automata in Coq
This page was built for software: Finite Automata HF
