{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:34Z","timestamp":1725577414039},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_5","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"39-48","source":"Crossref","is-referenced-by-count":4,"title":["Incremental DFA Minimisation"],"prefix":"10.1007","author":[{"given":"Marco","family":"Almeida","sequence":"first","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-02979-0_10","volume-title":"Implementation and Application of Automata","author":"A. Almeida","year":"2009","unstructured":"Almeida, A., Almeida, M., Alves, J., Moreira, N., Reis, R.: FAdo and GUItar: tools for automata manipulation and visualization. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol.\u00a05642, pp. 65\u201374. Springer, Heidelberg (2009)"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2007.07.029","volume":"387","author":"M. Almeida","year":"2007","unstructured":"Almeida, M., Moreira, N., Reis, R.: Enumeration and generation with a string automata representation. Theoret. Comput. Sci.\u00a0387(2), 93\u2013102 (2007); Special issue Selected papers of DCFS 2006","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR3","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Fox, J. (ed.) Proc. of the Sym. on Math. Theory of Automata, NY. MRI Symposia Series, vol.\u00a012, pp. 529\u2013561 (1963)"},{"key":"5_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2003","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT, Cambridge (2003)"},{"key":"5_CR5","unstructured":"Project FAdo. FAdo: tools for formal languages manipulation, \n                  \n                    http:\/\/www.ncc.up.pt\/FAdo\n                  \n                  \n                 (access date:1.1.2010)"},{"key":"5_CR6","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"2000","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading (2000)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Proc. Inter. Symp. on the Theory of Machines and Computations","author":"J. Hopcroft","year":"1971","unstructured":"Hopcroft, J.: An nlogn algorithm for minimizing states in a finite automaton. In: Proc. Inter. Symp. on the Theory of Machines and Computations, Haifa, Israel, pp. 189\u2013196. Academic Press, London (1971)"},{"issue":"1","key":"5_CR8","first-page":"69","volume":"20","author":"D.A. Huffman","year":"1955","unstructured":"Huffman, D.A.: The synthesis of sequential switching circuits. The Journal of Symbolic Logic\u00a020(1), 69\u201370 (1955)","journal-title":"The Journal of Symbolic Logic"},{"issue":"1","key":"5_CR9","first-page":"60","volume":"23","author":"E.F. Moore","year":"1958","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. The Journal of Symbolic Logic\u00a023(1), 60 (1958)","journal-title":"The Journal of Symbolic Logic"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. JACM\u00a022(2), 215\u2013225 (1975)","journal-title":"JACM"},{"key":"5_CR11","unstructured":"Watson, B.W.: Taxonomies and toolkit of regular languages algortihms. PhD thesis, Eindhoven Univ. of Tec. (1995)"},{"key":"5_CR12","unstructured":"Watson, B.W.: An incremental DFA minimization algorithm. In: International Workshop on Finite-State Methods in Natural Language Processing, Helsinki, Finland (August 2001)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Watson, B.W., Daciuk, J.: An efficient DFA minimization algorithm. Natural Language Engineering, 49\u201364 (2003)","DOI":"10.1017\/S1351324903003127"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T02:17:30Z","timestamp":1553393850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}