Pages that link to "Item:Q2938041"

The following pages link to A Constructive Theory of Regular Languages in Coq (Q2938041):

Displayed 7 items.

• Formally verified algorithms for upper-bounding state space diameters (Q1663245) ‎ (← links)
• Regular language representations in the constructive type theory of Coq (Q1663246) ‎ (← links)
• A formalisation of the Myhill-Nerode theorem based on regular expressions (Q2351151) ‎ (← links)
• On the Formalization of Some Results of Context-Free Language Theory (Q2820703) ‎ (← links)
• Two-Way Automata in Coq (Q2829256) ‎ (← links)
• A Formalisation of Finite Automata Using Hereditarily Finite Sets (Q3454094) ‎ (← links)
• A Verified Compositional Algorithm for AI Planning (Q5875407) ‎ (← links)