Hereditarily Finite Sets

From MaRDI portal

Revision as of 20:45, 5 March 2024 by Import240305080343 (talk | contribs) (Created automatically from import240305080343)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Software:40963

Jump to:navigation, search

swMATH29249MaRDI QIDQ40963

No author found.

Described by source

A Formalisation of Finite Automata Using Hereditarily Finite Sets

Related Items (5)

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: Hereditarily Finite Sets

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Software:40963&oldid=29502539"