{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:33Z","timestamp":1759638393302},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055777","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"277-285","source":"Crossref","is-referenced-by-count":7,"title":["Computing \u03b5-free NFA from regular expressions in O(n log2(N)) time"],"prefix":"10.1007","author":[{"given":"Christian","family":"Hagenah","sequence":"first","affiliation":[]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G. Berry","year":"1986","unstructured":"G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoretical Computer Science, 48:117\u2013126, 1986.","journal-title":"Theoretical Computer Science"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"120","author":"A. Br\u00fcggemann-Klein","year":"1993","unstructured":"A. Br\u00fcggemann-Klein. Regular expressions into finite automata. Theoretical Computer Science, 120:197\u2013213, 1993.","journal-title":"Theoretical Computer Science"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0022-0000(76)80034-7","volume":"12","author":"A. Ehrenfeucht","year":"1976","unstructured":"A. Ehrenfeucht and P. Zeiger. Complexity measures for regular expressions. Journal of Computer and System Sciences, 12:134\u2013146, 1976.","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR4","unstructured":"A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1989."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, S. Seibert, and T. Wilke. Translating regular expressions into small \u03b5-free nondeterministic finite automata. In Proc. of the 14th Ann. Symp. on Theor. Aspects of Comp. Sci. (STACS'97), no. 1200 in LNCS, p. 55\u201366, 1997. Springer.","DOI":"10.1007\/BFb0023448"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T14:44:15Z","timestamp":1555771455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0055777","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}