A Compact Proof of Decidability for Regular Expression Equivalence

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]

Authors

Andrea Asperti

This author has not been identified. Look up 'Andrea Asperti' in Google