{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:45Z","timestamp":1725511785068},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_8","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"85-96","source":"Crossref","is-referenced-by-count":1,"title":["On the Size of the Universal Automaton of a Regular Language"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Lombardy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2004.09.008","volume":"330","author":"C. C\u00e2mpeanu","year":"2005","unstructured":"C\u00e2mpeanu, C., S\u00e2ntean, N., Yu, S.: Mergible states in large nfa. Theoret. Comput. Sci.\u00a0330(1), 23\u201334 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"8_CR2","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. Theoret. Comput. Sci.\u00a0327(3), 241\u2013253 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"8_CR3","first-page":"497","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages (Errata in Theoret. Comput. Sci. 302, 497\u2013498 (2003)). Theoret. Comput. Sci. 47\u00a047(2), 497\u2013498 (1986)","journal-title":"Theoret. Comput. Sci. 47"},{"key":"8_CR4","series-title":"Mathematics series","volume-title":"Regular algebra and finite machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular algebra and finite machines. Mathematics series. Chapmann and Hall, London (1971)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/11753728_22","volume-title":"Computer Science \u2013 Theory and Applications","author":"I. Grunsky","year":"2006","unstructured":"Grunsky, I., Kurganskyy, O., Potapov, I.: On a maximal nfa without mergible states. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 202\u2013210. Springer, Heidelberg (2006)"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of machines and computations (Proc. Internat. Sympos., Technion, Haifa, 1971)","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. In: Theory of machines and computations (Proc. Internat. Sympos., Technion, Haifa, 1971), pp. 189\u2013196. Academic Press, New York (1971)"},{"issue":"1-3","key":"8_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. Theoret. Comput. Sci.\u00a0306(1-3), 373\u2013390 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"8_CR8","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T. Jiang","year":"1993","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput.\u00a022(6), 1117\u20131141 (1993)","journal-title":"SIAM J. Comput."},{"key":"8_CR9","first-page":"5","volume":"38","author":"A.D. Korshunov","year":"1981","unstructured":"Korshunov, A.D.: The number of monotone Boolean functions. Problemy Kibernet.\u00a038, 5\u2013108 (1981)","journal-title":"Problemy Kibernet."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-45465-9_16","volume-title":"Automata, Languages and Programming","author":"S. Lombardy","year":"2002","unstructured":"Lombardy, S.: On the construction of reversible automata for reversible languages. In: Widmayer, P., et al. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 170\u2013182. Springer, Heidelberg (2002)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-45995-2_12","volume-title":"LATIN 2002: Theoretical Informatics","author":"S. Lombardy","year":"2002","unstructured":"Lombardy, S., Sakarovitch, J.: Star height of reversible languages and universal automata. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 76\u201390. Springer, Heidelberg (2002)"},{"key":"8_CR12","volume-title":"Les classiques de l\u2019informatique","author":"J. Sakarovitch","year":"2003","unstructured":"Sakarovitch, J.: \u00c9l\u00e9ments de th\u00e9orie des automates (English translation to appear, Cambridge University Press). In: Les classiques de l\u2019informatique, Vuibert, Paris (2003)"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00385808","volume":"8","author":"D. Wiedemann","year":"1991","unstructured":"Wiedemann, D.: A computation of the eighth Dedekind number. Order\u00a08(1), 5\u20136 (1991)","journal-title":"Order"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:12:03Z","timestamp":1605762723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_8","relation":{},"subject":[]}}