A Compact Proof of Decidability for Regular Expression Equivalence

DOI10.1007/978-3-642-32347-8_19zbMath1360.68738OpenAlexW46198887MaRDI QIDQ2914749

Andrea Asperti

Publication date: 20 September 2012

Published in: Interactive Theorem Proving (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32347-8_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Deciding Regular Expressions (In-)Equivalence in Coq ⋮ Verified decision procedures for MSO on words based on derivatives of regular expressions ⋮ Deciding Kleene algebra terms equivalence in Coq ⋮ A formalisation of the Myhill-Nerode theorem based on regular expressions

Uses Software

• Matita
• Coq/SSReflect

This page was built for publication: A Compact Proof of Decidability for Regular Expression Equivalence