{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:20:07Z","timestamp":1743096007475,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53733-7_16","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T05:39:21Z","timestamp":1487137161000},"page":"223-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimization of Finite State Automata Through Partition Aggregation"],"prefix":"10.1007","author":[{"given":"Johanna","family":"Bj\u00f6rklund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loek","family":"Cleophas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.entcs.2009.08.026","volume":"251","author":"PA Abdulla","year":"2009","unstructured":"Abdulla, P.A., Hol\u00edk, L., Kaati, L., Vojnar, T.: A uniform (bi-)simulation-based framework for reducing tree automata. Electron. Notes Theor. Comput. Sci. 251, 27\u201348 (2009)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"16_CR2","volume-title":"The design and analysis of computer algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1974)"},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1051\/ita\/2013045","volume":"48","author":"M Almeida","year":"2014","unstructured":"Almeida, M., Moreira, N., Reis, R.: Incremental DFA minimisation. RAIRO - Theor. Inform. Appl. 48(2), 173\u2013186 (2014)","journal-title":"RAIRO - Theor. Inform. Appl."},{"issue":"37","key":"16_CR4","doi-asserted-by":"publisher","first-page":"3539","DOI":"10.1016\/j.tcs.2009.03.022","volume":"410","author":"J Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, J., Maletti, A., May, J.: Backward and forward bisimulation minimization of tree automata. Theor. Comput. Sci. 410(37), 3539\u20133552 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"16_CR5","first-page":"103","volume":"92","author":"J Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, J., Maletti, A., Vogler, H.: Bisimulation minimisation of weighted automata on unranked trees. Fundamenta Informatica 92(1\u20132), 103\u2013130 (2009)","journal-title":"Fundamenta Informatica"},{"issue":"13","key":"16_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2007.11.018","volume":"393","author":"P Buchholz","year":"2008","unstructured":"Buchholz, P.: Bisimulation relations for weighted automata. Theor. Comput. Sci. 393(13), 109\u2013123 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR7","unstructured":"Cleophas, L., Kourie, D.G., Strauss, T., Watson, B.W.: On minimizing deterministic tree automata. In: Holub, J., \u017d\n                      \n                        \n                      \n                      $$\\check{\\text{d}}$$\n                    \u00e1rek, J. (eds.) Prague Stringology Conference, Prague, Czech Republic, pp. 173\u2013182 (2009)"},{"key":"16_CR8","volume-title":"Optimization of Automata","author":"J Daciuk","year":"2014","unstructured":"Daciuk, J.: Optimization of Automata. Gda\u0144sk University of Technology Publishing House, Gda\u0144sk (2014)"},{"issue":"6","key":"16_CR9","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.jcss.2006.11.002","volume":"73","author":"G Gramlich","year":"2007","unstructured":"Gramlich, G., Schnitger, G.: Minimizing NFA\u2019s and regular expressions. J. Comput. Syst. Sci. 73(6), 908\u2013923 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An \n                      \n                        \n                      \n                      $$n$$\n                     log \n                      \n                        \n                      \n                      $$n$$\n                     algorithm for minimizing the states in a finite automaton. In: Kohavi, Z. (ed.) The Theory of Machines and Computations, pp. 189\u2013196. Academic Press (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1137\/0202024","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Ullman, J.D.: Set merging algorithms. SIAM J. Comput. 2(4), 294\u2013303 (1973)","journal-title":"SIAM J. Comput."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Huffman, D.A.: The synthesis of sequential switching circuits. J. Franklin Inst. 257, 161\u2013190, 275\u2013303 (1954)","DOI":"10.1016\/0016-0032(54)90618-3"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-14684-8_7","volume-title":"Finite-State Methods and Natural Language Processing","author":"A Maletti","year":"2010","unstructured":"Maletti, A.: Minimizing weighted tree grammars using simulation. In: Yli-Jyr\u00e4, A., Kornai, A., Sakarovitch, J., Watson, B. (eds.) FSMNLP 2009. LNCS (LNAI), vol. 6062, pp. 56\u201368. Springer, Heidelberg (2010). doi:\n                      10.1007\/978-3-642-14684-8_7"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: 13th Annual IEEE Symposium on Switching and Automata Theory, pp. 125\u2013129 (1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"16_CR15","first-page":"129","volume":"34","author":"EF Moore","year":"1956","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. Automata Stud. 34, 129\u2013153 (1956). Princeton University Press, Princeton, New Jersey","journal-title":"Automata Stud."},{"issue":"4","key":"16_CR16","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proc. Am. Math. Soc. 9(4), 541\u2013544 (1958)","journal-title":"Proc. Am. Math. Soc."},{"issue":"6","key":"16_CR17","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"16_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215\u2013225 (1975)","journal-title":"J. ACM"},{"key":"16_CR19","unstructured":"ten Eikelder, H.: Some algorithms to decide the equivalence of recursive types. Technical report 93\/32, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven (1991)"},{"key":"16_CR20","unstructured":"Watson, B.W.: Taxonomies and toolkits of regular language algorithms. Ph.D. thesis, Department of Mathematics and Computer Science, TU Eindhoven (1995)"},{"issue":"1","key":"16_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1017\/S1351324903003127","volume":"9","author":"BW Watson","year":"2003","unstructured":"Watson, B.W., Daciuk, J.: An efficient incremental DFA minimization algorithm. Nat. Lang. Eng. 9(1), 49\u201364 (2003)","journal-title":"Nat. Lang. Eng."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:45:19Z","timestamp":1558316719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/grammars.grlmc.com\/LATA2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}