{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:27Z","timestamp":1725577407634},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_27","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T13:56:14Z","timestamp":1296827774000},"page":"251-260","source":"Crossref","is-referenced-by-count":2,"title":["A Challenging Family of Automata for Classical Minimization Algorithms"],"prefix":"10.1007","author":[{"given":"Giusi","family":"Castiglione","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Nicaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-13509-5_25","volume-title":"Combinatorial Pattern Matching","author":"O. AitMous","year":"2010","unstructured":"AitMous, O., Bassino, F., Nicaud, C.: Building the minimal automaton of A*X in linear time, when X is of bounded cardinality. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol.\u00a06129, pp. 275\u2013287. Springer, Heidelberg (2010)"},{"key":"27_CR2","unstructured":"Almeida, M., Moreira, N., Reis, R.: On the performance of automata minimization algorithms. Technical Report DCC-2007-03, Universidade do Porto (2007)"},{"key":"27_CR3","unstructured":"Bassino, F., David, J., Nicaud, C.: On the average complexity of Moore\u2019s state minimization algorithm. In: STACS, pp. 123\u2013134 (2009)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"B\u00e9al, M.-P., Crochemore, M.: Minimizing local automata. In: IEEE International Symposium on Information Theory (ISIT 2007), pp. 1376\u20131380 (2007)","DOI":"10.1109\/ISIT.2007.4557131"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"2811","DOI":"10.1016\/j.tcs.2009.01.039","volume":"410","author":"J. Berstel","year":"2009","unstructured":"Berstel, J., Boasson, L., Carton, O.: Continuant polynomials and worst-case behavior of Hopcroft\u2019s minimization algorithm. TCS\u00a0410, 2811\u20132822 (2009)","journal-title":"TCS"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00224-009-9228-0","volume":"46","author":"J. Berstel","year":"2010","unstructured":"Berstel, J., Boasson, L., Carton, O., Fagnot, I.: Sturmian trees. Theory of Computing Systems\u00a046(3), 443\u2013478 (2010)","journal-title":"Theory of Computing Systems"},{"key":"27_CR7","first-page":"529","volume":"12","author":"J.A. Brzozowski","year":"1962","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata\u00a012, 529\u2013561 (1962)","journal-title":"Mathematical Theory of Automata"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"4372","DOI":"10.1016\/j.tcs.2009.07.018","volume":"410","author":"G. Castiglione","year":"2009","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: Circular sturmian words and Hopcroft\u2019s algorithm. TCS\u00a0410, 4372\u20134381 (2009)","journal-title":"TCS"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: On extremal cases of Hopcroft\u2019s algorithm. TCS\u00a0411(38-39), 3414\u20133422 (2010)","DOI":"10.1016\/j.tcs.2010.05.025"},{"key":"27_CR10","unstructured":"Champarnaud, J.-M., Khorsi, A., Parantho\u00ebn, T.: Split and join for minimizing: Brzozowski\u2019s algorithm. In: PSC 2002, pp. 96\u2013104 (2002)"},{"key":"27_CR11","volume-title":"Finite State Methods in Natural Language Processing","author":"J. Daciuk","year":"1998","unstructured":"Daciuk, J., Watson, R.E., Watson, B.W.: Incremental construction of acyclic finite-state automata and transducers. In: Finite State Methods in Natural Language Processing, Bilkent University, Ankara, Turkey (1998)"},{"issue":"2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)00035-H","volume":"136","author":"A. Luca de","year":"1994","unstructured":"de Luca, A., Mignosi, F.: Some combinatorial properties of Sturmian words. TCS\u00a0136(2), 361\u2013385 (1994)","journal-title":"TCS"},{"key":"27_CR13","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","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An nlogn algorithm for mimimizing the states in a finite automaton. In: Theory of Machines and Computations, Proc. Internat. Sympos. Technion, Haifa, pp. 189\u2013196. Academic Press, New York (1971)"},{"key":"27_CR14","first-page":"129","volume-title":"Gedaken experiments on sequential machines","author":"E.F. Moore","year":"1956","unstructured":"Moore, E.F.: Gedaken experiments on sequential machines, pp. 129\u2013153. Princeton University Press, Princeton (1956)"},{"issue":"1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","volume":"92","author":"D. Revuz","year":"1992","unstructured":"Revuz, D.: Minimisation of acyclic deterministic automata in linear time. TCS\u00a092(1), 181\u2013189 (1992)","journal-title":"TCS"},{"key":"27_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11591191_28","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Tabakov","year":"2005","unstructured":"Tabakov, D., Vardi, M.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 396\u2013411. Springer, Heidelberg (2005)"},{"key":"27_CR17","unstructured":"Watson, B.: A taxonomy of finite automata minimization algorithms. Technical Report 93\/44, Eindhoven Univ. of Tech., Faculty of Math. and Comp. Sc. (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-18098-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T06:28:00Z","timestamp":1553408880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}