{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T05:30:45Z","timestamp":1734067845032,"version":"3.30.2"},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0022-0000(03)00036-9","type":"journal-article","created":{"date-parts":[[2003,6,9]],"date-time":"2003-06-09T21:53:18Z","timestamp":1055195598000},"page":"451-472","source":"Crossref","is-referenced-by-count":16,"title":["Translation of binary regular expressions into nondeterministic \u03b5-free automata with O(nlogn) transitions"],"prefix":"10.1016","volume":"66","author":[{"given":"Viliam","family":"Geffert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00036-9_BIB1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1109\/T-C.1971.223204","article-title":"Ambiguity in graphs and expressions","volume":"C-20","author":"Book","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0022-0000(03)00036-9_BIB2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0022-0000(76)80034-7","article-title":"Complexity measures for regular expressions","volume":"12","author":"Ehrenfeucht","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00036-9_BIB3","doi-asserted-by":"crossref","unstructured":"J. Hartmanis, P.M. Lewis II, R.E. Stearns, Memory bounds for the recognition of context free and context sensitive languages, in: IEEE Conference Record on Switching Circuit Theory and Logical Design, New York, NY, 1965, pp. 191\u2013202.","DOI":"10.1109\/FOCS.1965.14"},{"year":"1969","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","key":"10.1016\/S0022-0000(03)00036-9_BIB4"},{"year":"1979","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","key":"10.1016\/S0022-0000(03)00036-9_BIB5"},{"key":"10.1016\/S0022-0000(03)00036-9_BIB6","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, S. Seibert, T. Wilke, Translating regular expressions into small \u03b5-free nondeterministic automata, in: Proceedings of the Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1200, Springer, Berlin, 1997, pp. 55\u201366.","DOI":"10.1007\/BFb0023448"},{"key":"10.1016\/S0022-0000(03)00036-9_BIB7","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1006\/jcss.2001.1748","article-title":"Translating regular expressions into small \u03b5-free nondeterministic finite automata","volume":"62","author":"Hromkovi\u010d","year":"2001","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00036-9_BIB8","doi-asserted-by":"crossref","first-page":"1976","DOI":"10.1137\/S009753979935431X","article-title":"Optimal simulations between unary automata","volume":"30","author":"Mereghetti","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00036-9_BIB9","article-title":"Parsing Theory, Vol. I: Languages and Parsing","volume":"Vol. 15","author":"Sippu","year":"1988"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000369?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000369?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T20:34:39Z","timestamp":1734035679000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0022000003000369"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00036-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}