1 Hit in 2.1 sec

Unified Decision Procedures for Regular Expression Equivalence [chapter]

Tobias Nipkow, Dmitriy Traytel
2014 Lecture Notes in Computer Science  
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 thank Andrea Asperti and Sebastian Fischer for commenting on fine points of their work and Helmut Seidl for contributing an informal proof of Thm. 5.  ... 
doi:10.1007/978-3-319-08970-6_29 fatcat:e6o3qmrwb5ccpai6imuto4fxk4