Finite Automata HF
From MaRDI portal
Software:40964
No author found.
Related Items (6)
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 ⋮ Graph theory in Coq: minors, treewidth, and isomorphisms ⋮ Two-Way Automata in Coq ⋮ Hereditarily Finite Sets in Constructive Type Theory
This page was built for software: Finite Automata HF
