Last update: Sun Oct 15 02:37:19 MDT 2017
@Article{Asperti:2012:CPD, author = "Andrea Asperti", title = "A Compact Proof of Decidability for Regular Expression Equivalence", journal = j-LECT-NOTES-COMP-SCI, volume = "7406", pages = "283--298", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-32347-8_19", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:21:53 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs2012g.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-32347-8_19/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-32347-8", book-URL = "http://www.springerlink.com/content/978-3-642-32347-8", fjournal = "Lecture Notes in Computer Science", }