{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:19:59Z","timestamp":1777105199677,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642223204","type":"print"},{"value":"9783642223211","type":"electronic"}],"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-22321-1_10","type":"book-chapter","created":{"date-parts":[[2011,7,14]],"date-time":"2011-07-14T23:58:48Z","timestamp":1310687928000},"page":"105-116","source":"Crossref","is-referenced-by-count":9,"title":["Theory of \u00c1tomata"],"prefix":"10.1007","author":[{"given":"Janusz","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hellis","family":"Tamm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"166","volume":"47","author":"A. Arnold","year":"1992","unstructured":"Arnold, A., Dicky, A., Nivat, M.: A note about minimal non-deterministic automata. Bull. EATCS\u00a047, 166\u2013169 (1992)","journal-title":"Bull. EATCS"},{"key":"10_CR2","series-title":"MRI Symposia Series","first-page":"529","volume-title":"Proceedings of the Symposium on Mathematical Theory of Automata","author":"J.A. Brzozowski","year":"1963","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of the Symposium on Mathematical Theory of Automata. MRI Symposia Series, vol.\u00a012, pp. 529\u2013561. Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y (1963)"},{"key":"10_CR3","unstructured":"Carrez, C.: On the minimalization of non-deterministic automaton. Technical report, Lille University, Lille, France (1970)"},{"key":"10_CR4","volume-title":"Regular Algebra and Finite Machines","author":"J. Conway","year":"1971","unstructured":"Conway, J.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)"},{"key":"10_CR5","first-page":"339","volume":"51","author":"F. Denis","year":"2002","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. Fund. Inform.\u00a051, 339\u2013368 (2002)","journal-title":"Fund. Inform."},{"issue":"7","key":"10_CR6","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1109\/T-C.1970.222994","volume":"C-19","author":"T. Kameda","year":"1970","unstructured":"Kameda, T., Weiner, P.: On the state minimization of nondeterministic automata. IEEE Trans. Comput. C-19(7), 617\u2013627 (1970)","journal-title":"IEEE Trans. Comput."},{"key":"10_CR7","series-title":"Texts in Logic and Games","first-page":"457","volume-title":"Logic and Automata: History and Perspectives","author":"S. Lombardy","year":"2007","unstructured":"Lombardy, S., Sakarovitch, J.: The universal automaton. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and Automata: History and Perspectives. Texts in Logic and Games, vol.\u00a02, pp. 457\u2013504. Amsterdam University Press, Amsterdam (2007)"},{"key":"10_CR8","unstructured":"Matz, O., Potthoff, A.: Computing small finite nondeterministic automata. In: Engberg, U.H., Larsen, K.G., Skou, A. (eds.) Proceedings of the Workshop on Tools and Algorithms for Construction and Analysis of Systems. BRICS Note Series, pp. 74\u201388. BRICS, Aarhus (1995)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"Rabin, M., Scott, D.: Finite automata and their decision problems. IBM J. Res. and Dev.\u00a03, 114\u2013129 (1959)","journal-title":"IBM J. Res. and Dev."},{"key":"10_CR10","unstructured":"Sengoku, H.: Minimization of nondeterministic finite automata. Master\u2019s thesis, Kyoto University, Department of Information Science, Kyoto University, Kyoto, Japan (1992)"},{"key":"10_CR11","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.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 396\u2013411. Springer, Heidelberg (2005)"},{"key":"10_CR12","unstructured":"Watson, B.W.: Taxonomies and toolkits of regular language algorithms. PhD thesis, Faculty of Mathematics and Computing Science. Eindhoven University of Technology, Eindhoven, The Netherlands (1995)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22321-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T22:54:51Z","timestamp":1553900091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22321-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223204","9783642223211"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22321-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}