{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:24:48Z","timestamp":1780050288704,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540323013","type":"print"},{"value":"9783540322887","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_35","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"432-443","source":"Crossref","is-referenced-by-count":16,"title":["Regular Expressions and NFAs Without \u03b5-Transitions"],"prefix":"10.1007","author":[{"given":"Georg","family":"Schnitger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1109\/T-C.1971.223204","volume":"20","author":"R. Book","year":"1971","unstructured":"Book, R., Even, S., Greibach, S., Ott, G.: Ambiguity in graphs and expressions. IEEE Trans. Comput.\u00a020, 149\u2013153 (1971)","journal-title":"IEEE Trans. Comput."},{"key":"35_CR2","first-page":"451","volume":"66","author":"V. Geffert","year":"2003","unstructured":"Geffert, V.: Translation of binary regular expressions into nondeterministic \u03b5-free automata with O(n logn) transitions. JCSS\u00a066, 451\u2013472 (2003)","journal-title":"JCSS"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"V.M. Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russian Math. Surveys\u00a016, 1\u201353 (1961); Translation by J. M. Jackson from Usp. Mat. Naut. 16, 3-41 (1961)","journal-title":"Russian Math. Surveys"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1051\/ita:2000116","volume":"34","author":"C. Hagenah","year":"2000","unstructured":"Hagenah, C., Muscholl, A.: Computing \u03b5-free NFA from regular expressions in O(n log2(n)) Time. R.A.I.R.O. Theoret. Inform. Appl.\u00a034, 257\u2013277 (2000)","journal-title":"R.A.I.R.O. Theoret. Inform. Appl."},{"key":"35_CR5","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)"},{"key":"35_CR6","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. Hromkovi\u010d","year":"2005","unstructured":"Hromkovi\u010d, 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":"35_CR7","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. J. of Comput. and Syst. Sci.\u00a062, 565\u2013588 (2001)","journal-title":"J. of Comput. and Syst. Sci."},{"issue":"6","key":"35_CR8","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. Process. Lett.\u00a085(6), 293\u2013299 (2003)","journal-title":"Process. Lett."},{"key":"35_CR9","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":"35_CR10","series-title":"Languages and Parsing","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61345-6","volume-title":"Parsing Theory","author":"S. Sippu","year":"1988","unstructured":"Sippu, S., Soisalon-Soininen, E.: Parsing Theory. Languages and Parsing, vol.\u00a0I. Springer, Heidelberg (1988)"},{"key":"35_CR11","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. Commun. ACM\u00a011, 419\u2013422 (1968)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T13:15:26Z","timestamp":1578489326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_35"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11672142_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}