Presburger Automata
From MaRDI portal
Software:40317
No author found.
Related Items (8)
Regular language representations in the constructive type theory of Coq ⋮ Automatic refinement to efficient data structures: a comparison of two approaches ⋮ Verified decision procedures for MSO on words based on derivatives of regular expressions ⋮ Partial and nested recursive function definitions in higher-order logic ⋮ Verified Synthesis of Knowledge-Based Programs in Finite Synchronous Environments ⋮ A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl) ⋮ Two-Way Automata in Coq ⋮ A formalisation of the Myhill-Nerode theorem based on regular expressions
This page was built for software: Presburger Automata
