{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:08:57Z","timestamp":1725559737717},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_32","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"385-396","source":"Crossref","is-referenced-by-count":6,"title":["NFAs With and Without \u03b5-Transitions"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]},{"given":"Georg","family":"Schnitger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (2001)"},{"issue":"4","key":"32_CR2","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/jcss.2001.1748","volume":"62","author":"J. Hromkovi\u010d","year":"2001","unstructured":"Hromkovi\u010d, J., Seibert, S., Wilke, T.: Translating regular expression into small \u03b5-free nondeterministic automata. Journal of Computer and System Sciences\u00a062(4), 565\u2013588 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"32_CR3","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"6","key":"32_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(02)00436-2","volume":"85","author":"Y. Lifshits","year":"2003","unstructured":"Lifshits, Y.: A lower bound on the size of \u03b5-free NFA corresponding to a regular expression. Inf. Process. Lett.\u00a085(6), 293\u2013299 (2003)","journal-title":"Inf. Process. Lett."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search. Comm. ACM\u00a011, 419\u2013422 (1968)","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:46:58Z","timestamp":1619506018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11523468_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}