{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:27Z","timestamp":1725545067609},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_26","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"307-318","source":"Crossref","is-referenced-by-count":1,"title":["Size Reduction of Multitape Automata"],"prefix":"10.1007","author":[{"given":"Hellis","family":"Tamm","sequence":"first","affiliation":[]},{"given":"Matti","family":"Nyk\u00e4nen","sequence":"additional","affiliation":[]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Develop.\u00a03, 114\u2013125 (1959)","journal-title":"IBM J. Res. Develop."},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(91)90356-7","volume":"78","author":"T. Harju","year":"1991","unstructured":"Harju, T., Karhum\u00e4ki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science\u00a078, 347\u2013355 (1991)","journal-title":"Theoretical Computer Science"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0306-4379(02)00075-3","volume":"28","author":"G. Grahne","year":"2003","unstructured":"Grahne, G., Hakli, R., Nyk\u00e4nen, M., Tamm, H., Ukkonen, E.: Design and implementation of a string database query language. Inform. Syst.\u00a028, 311\u2013337 (2003)","journal-title":"Inform. Syst."},{"key":"26_CR4","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.\u00a0C-19, 617\u2013627 (1970)","journal-title":"IEEE Trans. Comput."},{"unstructured":"Tamm, H.: On minimality and size reduction of one-tape and multitape finite automata. PhD thesis, Department of Computer Science, University of Helsinki, Finland (2004)","key":"26_CR5"},{"key":"26_CR6","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0304-3975(03)00311-6","volume":"306","author":"L. Ilie","year":"2003","unstructured":"Ilie, L., Yu, S.: Reducing NFAs by invariant equivalences. Theoretical Computer Science\u00a0306, 373\u2013390 (2003)","journal-title":"Theoretical Computer Science"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-27812-2_11","volume-title":"Theory Is Forever","author":"L. Ilie","year":"2004","unstructured":"Ilie, L., Navarro, G., Yu, S.: On NFA reductions. In: Karhum\u00e4ki, J., Maurer, H., P\u0103un, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol.\u00a03113, pp. 112\u2013124. Springer, Heidelberg (2004)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.tcs.2004.02.048","volume":"327","author":"J.M. Champarnaud","year":"2004","unstructured":"Champarnaud, J.M., Coulon, F.: NFA reduction algorithms by means of regular inequalities. Theoretical Computer Science\u00a0327, 241\u2013253 (2004)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:05:20Z","timestamp":1619507120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11605157_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}