{"month":"01","citation":{"apa":"Henzinger, T. A., & Raskin, J. (2015). The equivalence problem for finite automata: Technical perspective. Communications of the ACM. ACM. https://doi.org/10.1145/2701001","mla":"Henzinger, Thomas A., and Jean Raskin. “The Equivalence Problem for Finite Automata: Technical Perspective.” Communications of the ACM, vol. 58, no. 2, ACM, 2015, pp. 86–86, doi:10.1145/2701001.","ieee":"T. A. Henzinger and J. Raskin, “The equivalence problem for finite automata: Technical perspective,” Communications of the ACM, vol. 58, no. 2. ACM, pp. 86–86, 2015.","ama":"Henzinger TA, Raskin J. The equivalence problem for finite automata: Technical perspective. Communications of the ACM. 2015;58(2):86-86. doi:10.1145/2701001","ista":"Henzinger TA, Raskin J. 2015. The equivalence problem for finite automata: Technical perspective. Communications of the ACM. 58(2), 86–86.","chicago":"Henzinger, Thomas A, and Jean Raskin. “The Equivalence Problem for Finite Automata: Technical Perspective.” Communications of the ACM. ACM, 2015. https://doi.org/10.1145/2701001.","short":"T.A. Henzinger, J. Raskin, Communications of the ACM 58 (2015) 86–86."},"isi":1,"intvolume":" 58","publisher":"ACM","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","year":"2015","day":"28","type":"journal_article","article_processing_charge":"No","publist_id":"5232","status":"public","volume":58,"date_updated":"2025-09-23T13:49:40Z","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"doi":"10.1145/2701001","date_published":"2015-01-28T00:00:00Z","page":"86-86","date_created":"2018-12-11T11:54:26Z","external_id":{"isi":["000349299600024"]},"oa_version":"None","_id":"1866","publication":"Communications of the ACM","issue":"2","publication_status":"published","title":"The equivalence problem for finite automata: Technical perspective"}