Andrea Asperti. A Compact Proof of Decidability for Regular Expression Equivalence. In Lennart Beringer, Amy P. Felty, editors, Interactive Theorem Proving - Third International Conference, ITP 2012, Princeton, NJ, USA, August 13-15, 2012. Proceedings. Volume 7406 of Lecture Notes in Computer Science, pages 283-298, Springer, 2012. [doi]
@inproceedings{Asperti12, title = {A Compact Proof of Decidability for Regular Expression Equivalence}, author = {Andrea Asperti}, year = {2012}, doi = {10.1007/978-3-642-32347-8_19}, url = {http://dx.doi.org/10.1007/978-3-642-32347-8_19}, researchr = {https://researchr.org/publication/Asperti12}, cites = {0}, citedby = {0}, pages = {283-298}, booktitle = {Interactive Theorem Proving - Third International Conference, ITP 2012, Princeton, NJ, USA, August 13-15, 2012. Proceedings}, editor = {Lennart Beringer and Amy P. Felty}, volume = {7406}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-32346-1}, }