{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:18:04Z","timestamp":1725596284611},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222559"},{"type":"electronic","value":"9783642222566"}],"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-22256-6_9","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T17:37:04Z","timestamp":1311010624000},"page":"88-99","source":"Crossref","is-referenced-by-count":2,"title":["Nondeterministic Moore Automata and Brzozowski\u2019s Algorithm"],"prefix":"10.1007","author":[{"given":"Giusi","family":"Castiglione","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","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":"9_CR2","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"},{"issue":"11","key":"9_CR3","first-page":"1180","volume":"3","author":"E. Calude","year":"1997","unstructured":"Calude, E., Lipponen, M.: Minimal deterministic incomplete automata. Journal of Universal Computer Science\u00a03(11), 1180\u20131193 (1997)","journal-title":"Journal of Universal Computer Science"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-18098-9_27","volume-title":"Implementation and Application of Automata","author":"G. Castiglione","year":"2011","unstructured":"Castiglione, G., Nicaud, C., Sciortino, M.: A challenging family of automata for classical minimization algorithms. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol.\u00a06482, pp. 251\u2013260. Springer, Heidelberg (2011)"},{"key":"9_CR5","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. Theor. Comput. Sci.\u00a0410, 4372\u20134381 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"38-39","key":"9_CR6","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.\u00a0411(38-39), 3414\u20133422 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR7","series-title":"FSMNLP","first-page":"14","volume-title":"Frontiers in Artificial Intelligence and Applications","author":"C. Cortes","year":"2008","unstructured":"Cortes, C., Mohri, M.: Learning with weighted transducers. In: Piskorski, J., Watson, B.W., Anssi, Y.-J. (eds.) Frontiers in Artificial Intelligence and Applications. FSMNLP, vol.\u00a019, pp. 14\u201322. IOS Press, Amsterdam (2008)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11578079_7","volume-title":"Progress in Pattern Recognition, Image Analysis and Applications","author":"P. Garc\u00eda","year":"2005","unstructured":"Garc\u00eda, P., Ru\u00edz, J., Cano, A., Alvarez, G.: Inference improvement by enlarging the training set while learning dFAs. In: Sanfeliu, A., Cort\u00e9s, M.L. (eds.) CIARP 2005. LNCS, vol.\u00a03773, pp. 59\u201370. Springer, Heidelberg (2005)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Proc. Internat. Sympos. Technion, Haifa,Theory of machines and computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An nlogn algorithm for mimimizing the states in a finite automaton. In: Proc. Internat. Sympos. Technion, Haifa,Theory of machines and computations, pp. 189\u2013196. Academic Press, New York (1971)"},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.ic.2010.11.017","volume":"209","author":"G. Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Pighizzini, G.: Optimal simulation of self-verifying automata by deterministic automata. Inf. Comput.\u00a0209(3), 528\u2013535 (2011)","journal-title":"Inf. Comput."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1109\/T-C.1970.222994","volume":"19","author":"T. Kameda","year":"1970","unstructured":"Kameda, T., Weiner, P.: On the state minimization of nondeterministic finite automata. IEEE Trans. Comput.\u00a019, 617\u2013627 (1970)","journal-title":"IEEE Trans. Comput."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/3-540-48320-9_27","volume-title":"CONCUR\u201999. Concurrency Theory","author":"O. Kupferman","year":"1999","unstructured":"Kupferman, O., Vardi, M.Y.: Robust satisfaction. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 383\u2013398. Springer, Heidelberg (1999)"},{"issue":"2","key":"9_CR13","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023(2), 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"issue":"1-2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(98)00115-7","volume":"234","author":"M. Mohri","year":"2000","unstructured":"Mohri, M.: Minimization algorithms for sequential transducers. Theor. Comput. Sci.\u00a0234(1-2), 177\u2013201 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR15","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)"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1969","unstructured":"Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development\u00a03, 114\u2013125 (1969)","journal-title":"IBM Journal of Research and Development"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1134\/S1064226910050153","volume":"55","author":"V. Solovev","year":"2010","unstructured":"Solovev, V.: Minimization of Moore finite automata by internal state gluing. Journal of Communications Technology and Electronics\u00a055, 584\u2013592 (2010)","journal-title":"Journal of Communications Technology and Electronics"},{"key":"9_CR18","first-page":"4","volume":"3","author":"M.A. Spivak","year":"1967","unstructured":"Spivak, M.A.: Minimization of a Moore automaton. Cybernetics and Systems Analysis\u00a03, 4\u20135 (1967)","journal-title":"Cybernetics and Systems Analysis"},{"key":"9_CR19","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.Y.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 396\u2013411. Springer, Heidelberg (2005)"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/scj.1184","volume":"34","author":"K. Takahashi","year":"2003","unstructured":"Takahashi, K., Fujiyoshi, A., Kasai, T.: A polynomial time algorithm to infer sequential machines. Systems and Computers in Japan\u00a034(1), 59\u201367 (2003)","journal-title":"Systems and Computers in Japan"},{"key":"9_CR21","unstructured":"Watson, B.W.: Taxonomies and toolkits of regular language algorithms. PhD thesis, Dep. Math. Comput. Sci. Technische Universiteit Eindhoven (1995)"}],"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-22256-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T02:30:49Z","timestamp":1560393049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22256-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222559","9783642222566"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22256-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}