{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:42:30Z","timestamp":1648633350146},"reference-count":15,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1051\/ita\/2011011","type":"journal-article","created":{"date-parts":[[2011,3,15]],"date-time":"2011-03-15T13:59:59Z","timestamp":1300197599000},"page":"59-75","source":"Crossref","is-referenced-by-count":4,"title":["Hopcroft's algorithm and tree-like automata"],"prefix":"10.1051","volume":"45","author":[{"given":"G.","family":"Castiglione","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,3,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-540-30500-2_4","volume":"3317","author":"Berstel","year":"2004","journal-title":"Lecture Notes in Computer Science"},{"key":"R2","doi-asserted-by":"crossref","first-page":"2811","DOI":"10.1016\/j.tcs.2009.01.039","volume":"410","author":"Berstel","year":"2009","journal-title":"Theoret. Comput. Sci."},{"key":"R3","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s00224-009-9228-0","volume":"46","author":"Berstel","year":"2010","journal-title":"Theor. Comput. Syst."},{"key":"R4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1051\/ita:2005038","volume":"450","author":"Borel","year":"2006","journal-title":"RAIRO-Theor. Inf. Appl."},{"key":"R5","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-540-88282-4_17","volume":"5196","author":"Castiglione","year":"2008","journal-title":"Lecture Notes in Computer Science"},{"key":"R6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/978-3-642-02979-0_5","volume":"5642","author":"Castiglione","year":"2009","journal-title":"Lecture Notes in Computer Science"},{"key":"R7","doi-asserted-by":"crossref","first-page":"3414","DOI":"10.1016\/j.tcs.2010.05.025","volume":"411","author":"Castiglione","year":"2010","journal-title":"Theoret. Comput. Sci."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"J.E. Hopcroft, An $n$ log $n$ algorithm for mimimizing the states in a finite automaton, inTheory of machines and computations (Proc. Internat. Sympos. Technion, Haifa, 1971). Academic Press, New York (1971), 189\u2013196.","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"R9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0304-3975(99)00150-4","volume":"250","author":"Knuutila","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"M. Lothaire,Algebraic Combinatorics on Words,Encyclopedia of Mathematics and its Applications90. Cambridge University Press (2002).","DOI":"10.1017\/CBO9781107326019"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"E.F. Moore, Gedaken experiments on sequential, inAutomata Studies. Annals of Mathematical Studies34(1956) 129\u2013153.","DOI":"10.1515\/9781400882618-006"},{"key":"R12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","volume":"40","author":"Paige","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"R13","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/978-3-540-70844-5_9","volume":"5148","author":"Paun","year":"2008","journal-title":"Lecture Notes in Computer Science"},{"key":"R14","doi-asserted-by":"crossref","first-page":"2424","DOI":"10.1016\/j.tcs.2009.02.034","volume":"410","author":"Paun","year":"2009","journal-title":"Theoret. Comput. Sci."},{"key":"R15","unstructured":"B. Watson,A taxonomy of finite automata minimization algorithms.Technical Report 93\/44, Eindhoven University of Technology, Faculty of Mathematics and Computing Science (1994)."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011011\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T07:37:23Z","timestamp":1560065843000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":15,"journal-issue":{"issue":"1"},"alternative-id":["ita100053"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2011011","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}