%0 Conference Paper %1 conf/itp/Asperti12 %A Asperti, Andrea %B ITP %D 2012 %E Beringer, Lennart %E Felty, Amy P. %I Springer %K dblp %P 283-298 %T A Compact Proof of Decidability for Regular Expression Equivalence. %U http://dblp.uni-trier.de/db/conf/itp/itp2012.html#Asperti12 %V 7406 %@ 978-3-642-32346-1

@inproceedings{conf/itp/Asperti12, added-at = {2017-06-04T00:00:00.000+0200}, author = {Asperti, Andrea}, biburl = {https://www.bibsonomy.org/bibtex/21471939b5abf989ddbda0243a60b5613/dblp}, booktitle = {ITP}, crossref = {conf/itp/2012}, editor = {Beringer, Lennart and Felty, Amy P.}, ee = {https://doi.org/10.1007/978-3-642-32347-8_19}, interhash = {631e2b5fdc924344703fe458af3d3dd3}, intrahash = {1471939b5abf989ddbda0243a60b5613}, isbn = {978-3-642-32346-1}, keywords = {dblp}, pages = {283-298}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T18:14:09.000+0200}, title = {A Compact Proof of Decidability for Regular Expression Equivalence.}, url = {http://dblp.uni-trier.de/db/conf/itp/itp2012.html#Asperti12}, volume = 7406, year = 2012 }