{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:21Z","timestamp":1760202561084},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405610"},{"type":"electronic","value":"9783540450894"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45089-0_7","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T07:27:35Z","timestamp":1193470055000},"page":"61-71","source":"Crossref","is-referenced-by-count":2,"title":["Bideterministic Automata and Minimal Representations of Regular Languages"],"prefix":"10.1007","author":[{"given":"Hellis","family":"Tamm","sequence":"first","affiliation":[]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"Angluin, D. Inference of reversible languages. Journal of the Association for Computing Machinery\n                           29,3 (1982), 741\u2013765.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"7_CR2","first-page":"529","volume":"12","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. 12, Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y., 1963, 529\u2013561.","journal-title":"Proceedings of the Symposium on Mathematical Theory of Automata"},{"key":"7_CR3","unstructured":"Hopcroft, J. E., and Ullman, J.D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley 1979."},{"issue":"6","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T. Jiang","year":"1993","unstructured":"Jiang, T., and Ravikumar, B. Minimal NFA problems are hard. SIAM J. Comput.\n                           22,6 (1993), 1117\u20131141.","journal-title":"SIAM J. Comput."},{"issue":"7","key":"7_CR5","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., and Weiner, P. On the state minimization of nondeterministic automata. IEEE Trans. Comput.\n                           C-19,7 (1970), 617\u2013627.","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1109\/18.21228","volume":"34","author":"D. J. Muder","year":"1988","unstructured":"Muder, D. J. Minimal trellises for block codes. IEEE Trans. Inform. Theory\n                           34,5 (1988), 1049\u20131053.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BFb0023844","volume-title":"Proceedings of the first LATIN conference","author":"J.-E. Pin","year":"1992","unstructured":"Pin, J.-E. On reversible automata. In Proceedings of the first LATIN conference, Lecture Notes in Computer Science 583, Springer, 1992, 401\u2013416."},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1775","DOI":"10.1016\/S0304-3975(02)00083-X","volume":"290","author":"P. Shankar","year":"2003","unstructured":"Shankar, P., Dasgupta, A., Deshmukh K., and Rajan B. S. On viewing block codes as finite automata. Theoretical Computer Science, 290,3 (2003), 1775\u20131797.","journal-title":"Theoretical Computer Science"},{"key":"7_CR9","volume-title":"Taxonomies and toolkits of regular language algorithms","author":"B. W. Watson","year":"1995","unstructured":"Watson, B. W. Taxonomies and toolkits of regular language algorithms. PhD dissertation, Faculty of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 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\/3-540-45089-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T15:53:24Z","timestamp":1551023604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45089-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405610","9783540450894"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45089-0_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}