{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:27:37Z","timestamp":1767929257466,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642212536","type":"print"},{"value":"9783642212543","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21254-3_32","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T09:38:04Z","timestamp":1306489084000},"page":"402-413","source":"Crossref","is-referenced-by-count":14,"title":["Bit-coded Regular Expression Parsing"],"prefix":"10.1007","author":[{"given":"Lasse","family":"Nielsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Fritz","family":"Henglein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-02927-1_16","volume-title":"Automata, Languages and Programming","author":"P. Bille","year":"2009","unstructured":"Bille, P., Thorup, M.: Faster regular expression matching. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 171\u2013182. Springer, Heidelberg (2009)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Brabrand, C., Thomsen, J.: Typed and unambiguous pattern matching on strings using regular expressions. In: Proc. 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, PPDP (2010)","DOI":"10.1145\/1836089.1836120"},{"issue":"4","key":"32_CR3","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1109\/18.9782","volume":"34","author":"R. Cameron","year":"1988","unstructured":"Cameron, R.: Source encoding using syntactic information source models. IEEE Transactions on Information Theory\u00a034(4), 843\u2013850 (1988)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"32_CR4","first-page":"625","volume":"15","author":"J. Contla","year":"1985","unstructured":"Contla, J.: Compact coding of syntactically correct source programs. Software: Practice and Experience\u00a015(7), 625\u2013636 (1985)","journal-title":"Software: Practice and Experience"},{"key":"32_CR5","unstructured":"Cox, R.: Regular expression matching can be simple and fast"},{"issue":"2","key":"32_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s002360000037","volume":"37","author":"D. Dub\u00e9","year":"2000","unstructured":"Dub\u00e9, D., Feeley, M.: Efficiently building a parse tree from a regular expression. Acta Informatica\u00a037(2), 121\u2013144 (2000)","journal-title":"Acta Informatica"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-540-27836-8_53","volume-title":"Automata, Languages and Programming","author":"A. Frisch","year":"2004","unstructured":"Frisch, A., Cardelli, L.: Greedy regular expression matching. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 618\u2013629. Springer, Heidelberg (2004)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Henglein, F., Nielsen, L.: Declarative coinductive axiomatization of regular expression containment and its computational interpretation (preliminary version). In: Proc. 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) (January 2011)","DOI":"10.1145\/1926385.1926429"},{"issue":"1","key":"32_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/1053468.1053470","volume":"27","author":"H. Hosoya","year":"2005","unstructured":"Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for xml. ACM Trans. Program. Lang. Syst.\u00a027(1), 46\u201390 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"32_CR10","unstructured":"Institute of Electrical and Electronics Engineers (IEEE): Standard for information technology \u2014 Portable Operating System Interface (POSIX) \u2014 Part 2 (Shell and utilities), Section 2.8 (Regular expression notation), New York, IEEE Standard 1003.2 (1992)"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/3-540-49099-X_18","volume-title":"Programming Languages and Systems","author":"P. Jansson","year":"1999","unstructured":"Jansson, P., Jeuring, J.: Polytypic compact printing and parsing. In: Swierstra, S.D. (ed.) ESOP 1999. LNCS, vol.\u00a01576, p. 639. Springer, Heidelberg (1999)"},{"key":"32_CR12","first-page":"3","volume":"34","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. Automata Studies\u00a034, 3\u201341 (1956)","journal-title":"Automata Studies"},{"key":"32_CR13","unstructured":"Nielsen, L.: Regular expression compression parser, http:\/\/www.thelas.dk\/index.php\/Rcp"},{"issue":"3","key":"32_CR14","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1145\/1133651.1133652","volume":"28","author":"S. Vansummeren","year":"2006","unstructured":"Vansummeren, S.: Type inference for unique pattern matching. ACM Trans. Program. Lang. Syst.\u00a028(3), 389\u2013428 (2006)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"32_CR15","volume-title":"Proc. 3d Int\u2019l Conf. on Software Testing, Verification and Validation","author":"M.V.M. Veanes","year":"2010","unstructured":"Veanes, M.V.M., de Halleux, P., Tillmann, N.: Rex: Symbolic regular expression explorer. In: Proc. 3d Int\u2019l Conf. on Software Testing, Verification and Validation, April 6-10. IEEE Computer Society Press, Paris (2010)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21254-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T07:11:24Z","timestamp":1560237084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21254-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212536","9783642212543"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21254-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}