{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T23:30:37Z","timestamp":1717025437575},"reference-count":15,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1051\/ita\/2013045","type":"journal-article","created":{"date-parts":[[2014,1,21]],"date-time":"2014-01-21T10:03:02Z","timestamp":1390298582000},"page":"173-186","source":"Crossref","is-referenced-by-count":4,"title":["Incremental DFA minimisation"],"prefix":"10.1051","volume":"48","author":[{"given":"Marco","family":"Almeida","sequence":"first","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2014,1,21]]},"reference":[{"key":"R1","unstructured":"A. Almeida, M. Almeida, J. Alves, N. Moreira and R. Reis, FAdo and GUItar: tools for automata manipulation and visualization, in vol. 564214th CIAA\u201909, edited by S. Maneth.Lect. Notes Comput. Sci.Springer (2009) 65\u201374."},{"key":"R2","unstructured":"Almeida M., Moreira N. and Reis R., Enumeration and generation with a string automata representation, Special issue Selected papers of DCFS (2006).Theoret. Comput. Sci.387(2007) 93\u2013102."},{"key":"R3","unstructured":"M. Almeida, N. Moreira and R. Reis, Incremental DFA minimisation, inProc. of the 15th International Conference on Implementation and Application of Automata (CIAA 2010)Winnipeg, MA, Canada, vol. 6482 ofLect. Notes Comput. Sci., edited by M. Domaratzki and K. Salomaa. Springer-Verlag (2010) 39\u201348."},{"key":"R4","unstructured":"M. Almeida,Equivalence of regular languages: an algorithmic approach and complexity analysis, Ph.D. thesis. University of Porto (2011)."},{"key":"R5","unstructured":"J.A. Brzozowski, Canonical regular expressions and minimal state graphs for definite events, in vol. 12 ofProc. of the Sym. on Math. Theory of Automata, edited by J. Fox.MRI Symposia Series, New York (1963) 529\u2013561."},{"key":"R6","unstructured":"T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein,Introduction to Algorithms. The MIT Press, 2nd edition (2003)."},{"key":"R7","unstructured":"Project FAdo, FAdo: tools for formal languages manipulation. , Access date:1.11.2011 http:\/\/fado.dcc.fc.up.pt\/, Access date:1.11.2011."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"J. Hopcroft, Annlog\u2009nalgorithm for minimizing states in a finite automaton, inProc. Inter. Symp. on the Theory of Machines and Computations, Haifa, Israel. Academic Press (1971) 189\u2013196.","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"R9","unstructured":"J.E. Hopcroft, R. Motwani and J.D. Ullman,Introduction to Automata Theory, Languages and Computation. Addison Wesley (2000)."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Huffman D.A., The synthesis of sequential switching circuits.J. Symbolic Logic20(1955) 69\u201370.","DOI":"10.2307\/2268078"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Moore E.F., Gedanken-experiments on sequential machines.J. Symbolic Logic23(1958) 60.","DOI":"10.2307\/2964500"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Tarjan R.E., Efficiency of a good but not linear set union algorithm.J. ACM22(1975) 215\u2013225.","DOI":"10.1145\/321879.321884"},{"key":"R13","unstructured":"B.W. Watson,Taxonomies and toolkit of regular languages algortihms,Ph.D. thesis. Eindhoven University of Tec. (1995)."},{"key":"R14","unstructured":"B.W. Watson, An incremental DFA minimization algorithm, inInternational Workshop on Finite-State Methods in Natural Language Processing. Helsinki, Finland (2001)."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"B.W. Watson and J. Daciuk, An efficient DFA minimization algorithm.Natur. Lang. Engrg.(2003) 49\u201364.","DOI":"10.1017\/S1351324903003127"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2013045\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:32:41Z","timestamp":1565112761000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2013045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,21]]},"references-count":15,"journal-issue":{"issue":"2"},"alternative-id":["ita120032"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2013045","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,21]]}}}