{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:46:56Z","timestamp":1725544016452},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540341666"},{"type":"electronic","value":"9783540341680"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_22","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T20:17:13Z","timestamp":1146169033000},"page":"202-210","source":"Crossref","is-referenced-by-count":2,"title":["On a Maximal NFA Without Mergible States"],"prefix":"10.1007","author":[{"given":"Igor","family":"Grunsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleksiy","family":"Kurganskyy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2004.09.008","volume":"330","author":"C. Campeanu","year":"2005","unstructured":"Campeanu, C., Santean, N., Yu, S.: Mergible states in large NFA. Theoretical Computer Science\u00a0330, 23\u201334 (2005)","journal-title":"Theoretical Computer Science"},{"key":"22_CR2","unstructured":"Campeanu, C., Santean, N., Yu, S.: Large NFA without mergible states. In: Proceedings of 7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005, pp. 75\u201384 (2005)"},{"key":"22_CR3","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Academic Press, Inc., Orlando (1974)"},{"key":"22_CR4","unstructured":"Grunsky, I.S., Kurganskyy, O.: Properties of languages that generated by undirected vertex-labeled graphs. In: Proceeding of 8-th International Seminar on Discrete mathematics and its applications, Moscow State University, pp. 267\u2013269 (2004) (in Russian)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/11549345_38","volume-title":"Mathematical Foundations of Computer Science 2005","author":"I.S. Grunsky","year":"2005","unstructured":"Grunsky, I.S., Kurganskyy, O., Potapov, I.: Languages Representable by Vertex-labeled Graphs. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 435\u2013446. Springer, Heidelberg (2005)"},{"issue":"4","key":"22_CR6","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/jcss.2001.1748","volume":"62","author":"J. Hromkovic","year":"2001","unstructured":"Hromkovic, J., Seibert, S., Wilke, T.: Translating Regular Expressions into Small \u03b5-Free Nondeterministic Finite Automata. J. Comput. Syst. Sci.\u00a062(4), 565\u2013588 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/11523468_32","volume-title":"Automata, Languages and Programming","author":"J. Hromkovic","year":"2005","unstructured":"Hromkovic, J., Schnitger, G.: NFAs With and Without \u03b5-Transitions. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 385\u2013396. Springer, Heidelberg (2005)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/11496656_27","volume-title":"Combinatorial Pattern Matching","author":"L. Ilie","year":"2005","unstructured":"Ilie, L., Solis-Oba, R., Yu, S.: Reducing the Size of NFAs by Using Equivalences and Preorders. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 310\u2013321. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:33Z","timestamp":1619507013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11753728_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}