{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:33Z","timestamp":1725577413266},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"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-18098-9_33","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"310-320","source":"Crossref","is-referenced-by-count":1,"title":["Regular Expressions at Their Best: A Case for Rational Design"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Le Maout","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","volume-title":"Compilers - Principles, Techniques and Tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers - Principles, Techniques and Tools. Addison-Wesley, Reading (1986)"},{"key":"33_CR2","volume-title":"Introduction to automata, languages and computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to automata, languages and computation. Addison-Wesley, Reading (1979)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51084-2_2","volume-title":"Symbolic and Algebraic Computation","author":"D.R. Musser","year":"1989","unstructured":"Musser, D.R., Stepanov, A.: Generic Programming. In: Gianni, P. (ed.) ISSAC 1988. LNCS, vol.\u00a0358. Springer, Heidelberg (1989)"},{"key":"33_CR4","unstructured":"Standard Template Library Programmer\u2019s Guide, Silicon Graphics Computer Systems (1999), http:\/\/www.sgi.com\/Technology\/STL"},{"key":"33_CR5","unstructured":"Stepanov, A., Lee, M.: The Standard Template Library. HP Laboratories Technical Report 95-11(R.1) (1995)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/BFb0031384","volume-title":"Automata Implementation","author":"V. Maout Le","year":"1998","unstructured":"Le Maout, V.: Tools to Implement Automata, a first step: ASTL. In: Wood, D., Yu, S. (eds.) WIA 1997. LNCS, vol.\u00a01436, pp. 104\u2013108. Springer, Heidelberg (1998)"},{"key":"33_CR7","unstructured":"Le Maout, V.: PhD Thesis: Exp\u00e9rience de programmation g\u00e9n\u00e9rique sur des structures non-s\u00e9quentielles: les automates, Universit\u00e9 de Marne-La-Vall\u00e9e (2003)"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-44674-5_16","volume-title":"Implementation and Application of Automata","author":"V. Maout Le","year":"2001","unstructured":"Le Maout, V.: Cursors. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol.\u00a02088, pp. 195\u2013207. Springer, Heidelberg (2001)"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Thompson, K.: Regular expression search algorithm. CACM\u00a011(6) (1968)","DOI":"10.1145\/363347.363387"},{"key":"33_CR10","unstructured":"Cox, R.: Regular Expression Matching Can Be Simple And Fast (2007), http:\/\/swtch.com\/~rsc\/regexp\/regexp1.html"},{"key":"33_CR11","unstructured":"Cox, R.: Regular Expression Matching: the Virtual Machine Approach (2009), http:\/\/swtch.com\/~rsc\/regexp\/regexp2.html"},{"key":"33_CR12","unstructured":"Cox, R.: Regular Expression Matching in the Wild (2010), http:\/\/swtch.com\/~rsc\/regexp\/regexp3.html"},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"EC-9","author":"R. McNaughton","year":"1960","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Transactions on Electronic Computers\u00a0EC-9(1), 39\u201347 (1960)","journal-title":"IRE Transactions on Electronic Computers"},{"key":"33_CR14","unstructured":"Laurikari, V.: Efficient Submatch Addressing for Regular Expressions (2001)"},{"key":"33_CR15","unstructured":"Laurikari, V.: NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions (2000)"},{"key":"33_CR16","unstructured":"Le Maout, V.: Regular Expression Performance Comparison (2010), http:\/\/astl.sourceforge.net\/bench.7.html"},{"key":"33_CR17","unstructured":"Maddock, J.: Boost Regex (2007), http:\/\/www.boost.org\/doc\/libs\/1_42_0\/libs\/regex\/doc\/html\/index.html"},{"key":"33_CR18","unstructured":"Niebler, E.: Boost Xpressive (2007), http:\/\/boost-sandbox.sourceforge.net\/libs\/xpressive\/doc\/html\/index.html"},{"key":"33_CR19","unstructured":"PCRE. Univ. Cambridge (2009), http:\/\/sourceforge.net\/projects\/pcre\/"},{"key":"33_CR20","unstructured":"Niebler, E.: GRETA. Microsoft (2003), http:\/\/research.microsoft.com\/en-us\/downloads\/BD99F343-4FF4-4041-8293-34C054EFE749\/default.aspx"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Cox, R.: RE2, Google (2010), http:\/\/code.google.com\/p\/re2\/","DOI":"10.1126\/scisignal.268re2"},{"issue":"10","key":"33_CR22","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. CACM\u00a020(10), 762\u2013772 (1977)","journal-title":"CACM"},{"key":"33_CR23","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R.N. Horspool","year":"1980","unstructured":"Horspool, R.N.: Practical fast searching in strings. Software - Practice & Experience\u00a010, 501\u2013506 (1980)","journal-title":"Software - Practice & Experience"},{"issue":"1","key":"33_CR24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(92)90133-Z","volume":"92","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A., R\u00e9gnier, M.: Average running time of the Boyer-Moore-Horspool algorithm. Theoretical Computer Science\u00a092(1), 19\u201331 (1992)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T06:18:39Z","timestamp":1559974719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}