The following pages link to Finite Automata HF (Q40964):
Displaying 6 items.
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
- Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
- Graph theory in Coq: minors, treewidth, and isomorphisms (Q2209536) (← links)
- Two-Way Automata in Coq (Q2829256) (← links)
- Hereditarily Finite Sets in Constructive Type Theory (Q2829273) (← links)
- A Formalisation of Finite Automata Using Hereditarily Finite Sets (Q3454094) (← links)
