The article describes a compact formalization of the relation between regular expressions and deterministic finite automata, and a formally verified, efficient algorithm for testing regular expression equivalence, both based on the original notion of pointed regular expression.
A. Asperti (2012). A Compact Proof of Decidability for Regular Expression Equivalence. Springer-Verlag [10.1007/978-3-642-32347-8_19].
A Compact Proof of Decidability for Regular Expression Equivalence
ASPERTI, ANDREA
2012
Abstract
The article describes a compact formalization of the relation between regular expressions and deterministic finite automata, and a formally verified, efficient algorithm for testing regular expression equivalence, both based on the original notion of pointed regular expression.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
