{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:57:16Z","timestamp":1742932636611,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029783"},{"type":"electronic","value":"9783642029790"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02979-0_5","type":"book-chapter","created":{"date-parts":[[2009,7,6]],"date-time":"2009-07-06T08:16:20Z","timestamp":1246868180000},"page":"14-23","source":"Crossref","is-referenced-by-count":2,"title":["On Extremal Cases of Hopcroft\u2019s Algorithm"],"prefix":"10.1007","author":[{"given":"Giusi","family":"Castiglione","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Berstel, J., Boasson, L., Carton, O.: Continuant Polynomials and worst-case of Hopcroft\u2019s algorithm. Theoretical Computer Science (to appear)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J., Boasson, L., Carton, O., Fagnot, I.: Sturmian trees. Theory of Computing Systems (to appear)","DOI":"10.1007\/s00224-009-9228-0"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-30500-2_4","volume-title":"Implementation and Application of Automata","author":"J. Berstel","year":"2005","unstructured":"Berstel, J., Carton, O.: On the complexity of Hopcroft\u2019s state minimization algorithm. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 35\u201344. Springer, Heidelberg (2005)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1051\/ita:2005038","volume":"450","author":"J.P. Borel","year":"2006","unstructured":"Borel, J.P., Reutenauer, C.: On Christoffel classes. RAIRO-Theoretical Informatics and Applications\u00a0450, 15\u201328 (2006)","journal-title":"RAIRO-Theoretical Informatics and Applications"},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00224-001-1006-6","volume":"34","author":"A. Carpi","year":"2001","unstructured":"Carpi, A., de Luca, A., Varricchio, S.: Special factors and uniqueness conditions in rational trees. Theory Comput. Syst.\u00a034(4), 375\u2013395 (2001)","journal-title":"Theory Comput. Syst."},{"key":"5_CR6","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: Circular sturmian words and hopcroft\u2019s algorithm. Theoretical Computer Science (to appear)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-88282-4_17","volume-title":"Language and Automata Theory and Applications","author":"G. Castiglione","year":"2008","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: Hopcroft\u2019s algorithm and cyclic automata. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 172\u2013183. Springer, Heidelberg (2008)"},{"key":"5_CR8","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: On a family of sturmian trees. Technical report, University of Palermo (2009)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of machines and computations (Proc. Internat. Sympos. Technion, Haifa, 1971)","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An nlogn algorithm for mimimizing the states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of machines and computations (Proc. Internat. Sympos. Technion, Haifa, 1971), pp. 189\u2013196. Academic Press, New York (1971)"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0304-3975(99)00150-4","volume":"250","author":"T. Knuutila","year":"2001","unstructured":"Knuutila, T.: Re-describing an algorithm by Hopcroft. Theoret. Comput. Sci.\u00a0250, 333\u2013363 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/S0304-3975(99)00317-5","volume":"255","author":"S. Mantaci","year":"2001","unstructured":"Mantaci, S., Restivo, A.: Codes and equations on trees. Theor. Comput. Sci.\u00a0255(1-2), 483\u2013509 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR12","unstructured":"Matz, O., Miller, A., Potthoff, A., Thomas, W., Valkema, E.: Report on the program AMoRE. Technical Report 9507, Inst. f. Informatik u. Prakt. Math., CAU Kiel (1995)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Gedaken experiments on sequential machines. In: Automata Studies, pp. 129\u2013153 (1956)","DOI":"10.1515\/9781400882618-006"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","volume":"40","author":"R. Paige","year":"1985","unstructured":"Paige, R., Tarjan, R.E., Bonic, R.: A linear time solution to the single function coarsest partition problem. Theor. Comput. Sci.\u00a040, 67\u201384 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR15","unstructured":"Watson, B.: A taxonomy of finite automata minimization algorithms. Technical Report 93\/44, Eindhoven University of Technology, Faculty of Mathematics and Computing Science (1994)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02979-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T03:41:38Z","timestamp":1558410098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02979-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029783","9783642029790"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02979-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}