{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:58:27Z","timestamp":1774025907406,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540243182","type":"print"},{"value":"9783540305002","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_37","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"325-326","source":"Crossref","is-referenced-by-count":5,"title":["Minimalizations of NFA Using the Universal Automaton"],"prefix":"10.1007","author":[{"given":"Libor","family":"Pol\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_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":"37_CR2","unstructured":"Carrez, C.: On the minimalization of non-deterministic automaton, Laboratoire de Calcul de la Facult\u00e9 des Sciences de l\u2019Universit\u00e9 de Lille (1970)"},{"key":"37_CR3","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Ltd., Boca Raton (1971)"},{"issue":"4","key":"37_CR4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.3233\/FUN-2002-51402","volume":"51","author":"F. Denis","year":"2002","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. Fundam. Inform.\u00a051(4), 339\u2013368 (2002)","journal-title":"Fundam. Inform."},{"issue":"1","key":"37_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(05)80006-7","volume":"40","author":"T. Jiang","year":"1991","unstructured":"Jiang, T., Ravikumar, B.: A note on the space complexity of some decision problems for finite automata. Inf. Process. Lett.\u00a040(1), 25\u201331 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"7","key":"37_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 minimalization of nondeterministic finite automata. IEEE Transactions on Computers\u00a0C-19(7), 617\u2013627 (1970)","journal-title":"IEEE Transactions on Computers"},{"key":"37_CR7","unstructured":"Matz, O., Potthoff, A.: Computing small nondeterministic finite automata. In: Proc. Workshop on Tools and Algorithms for the Construction and Analysis of Systems 1995, BRICS Lecture Notes, pp. 74\u201388 (1995)"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/3-540-45007-6_33","volume-title":"Developments in Language Theory","author":"L. Pol\u00e1k","year":"2003","unstructured":"Pol\u00e1k, L.: Syntactic semiring and universal automaton. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 411\u2013422. Springer, Heidelberg (2003)"},{"key":"37_CR9","unstructured":"Pol\u00e1k, L.: Minimalization of NFA using the universal automaton. In: Preproc. Descriptional Complexity of Formal Systems, London, Canada, pp. 238\u2013249 (2004)"},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45089-0_7","volume-title":"Implementation and Application of Automata","author":"H. Tamm","year":"2003","unstructured":"Tamm, H., Ukkonen, E.: Bideterministic automata and minimal representations of regular languages. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol.\u00a02759, pp. 61\u201371. Springer, Heidelberg (2003)"}],"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-540-30500-2_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T22:40:12Z","timestamp":1739918412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}