{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:00:33Z","timestamp":1743026433948,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319948119"},{"type":"electronic","value":"9783319948126"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94812-6_21","type":"book-chapter","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T22:12:26Z","timestamp":1530223946000},"page":"248-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two Routes to Automata Minimization and the Ways to Reach It Efficiently"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Lombardy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Sakarovitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"21_CR1","unstructured":"B\u00e9al, M.P., Crochemore, M.: Minimizing incomplete automata. In: Finite-State Methods and Natural Language Processing FSMNLP 2008, pp. 9\u201316 (2008)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11753728_9","volume-title":"Computer Science \u2013 Theory and Applications","author":"M-P B\u00e9al","year":"2006","unstructured":"B\u00e9al, M.-P., Lombardy, S., Sakarovitch, J.: Conjugacy and equivalence of weighted automata and functional transducers. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 58\u201369. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11753728_9"},{"key":"21_CR3","unstructured":"Berstel, J., Boasson, L., Carton, O., Fagnot, I.: Minimization of automata. In: Pin, J.E. (ed.) Automata: From Mathematics to Applications (to appear). arXiv:1010.5318v3"},{"key":"21_CR4","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. 3317, pp. 35\u201344. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30500-2_4"},{"issue":"38\u201339","key":"21_CR5","doi-asserted-by":"publisher","first-page":"3414","DOI":"10.1016\/j.tcs.2010.05.025","volume":"411","author":"G Castiglione","year":"2010","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: On extremal cases of Hopcroft\u2019s algorithm. Theor. Comput. Sci. 411(38\u201339), 3414\u20133422 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF00264025","volume":"2","author":"D Gries","year":"1973","unstructured":"Gries, D.: Describing an algorithm by Hopcroft. Acta Informatica 2, 97\u2013109 (1973)","journal-title":"Acta Informatica"},{"key":"21_CR7","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 3rd edn. Addison-Wesley, Boston (2006)","edition":"3"},{"key":"21_CR8","unstructured":"Paige, R.: Efficient translation of external input in a dynamically typed language. In: Technology and Foundations - Information Processing IFIP 1994, IFIP Transactions, vol. A-51, pp. 603\u2013608. North-Holland (1994)"},{"issue":"6","key":"21_CR9","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"21_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, New York (2009)"},{"key":"21_CR11","unstructured":"Valmari, A., Lehtinen, P.: Efficient minimization of DFAs with partial transition. In: STACS 2008, LIPIcs, vol. 1, pp. 645\u2013656. Schloss Dagstuhl (2008)"},{"key":"21_CR12","unstructured":"Awali: Another Weighted Automata LIbrary. vaucanson-project.org\/AWALI"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94812-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:54:23Z","timestamp":1709826863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94812-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948119","9783319948126"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94812-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Charlottetown, PE","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.smcs.upei.ca\/ciaa2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}