Unified Decision Procedures for Regular Expression Equivalence (Q7361068)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Regex_Equivalence
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unified Decision Procedures for Regular Expression Equivalence |
AFP entry Regex_Equivalence |
Statements
30 January 2014
0 references
Tobias Nipkow
0 references
Dmitriy Traytel
0 references
Unified Decision Procedures for Regular Expression Equivalence (English)
0 references
We formalize a unified framework for verified decision procedures for regular expression equivalence. Five recently published formalizations of such decision procedures (three based on derivatives, two on marked regular expressions) can be obtained as instances of the framework. We discover that the two approaches based on marked regular expressions, which were previously thought to be the same, are different, and one seems to produce uniformly smaller automata. The common framework makes it possible to compare the performance of the different decision procedures in a meaningful way.
0 references
