{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:30Z","timestamp":1759637550949},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_25","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"231-240","source":"Crossref","is-referenced-by-count":13,"title":["Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Okui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taro","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"The Open Group Base Specification Issue 6 IEEE Std 1003.1 2004 Edition (2004), \n                  \n                    http:\/\/www.opengroup.org\/onlinepubs\/009695399\/basedefs\/xbd_chap09.html"},{"key":"25_CR2","unstructured":"Cox, R.: Regular Expression Matching Can Be Simple and Fast (2007), \n                  \n                    http:\/\/swtch.com\/~rsc\/regexp\/regexp1.html"},{"key":"25_CR3","unstructured":"Cox, R.: Regular Expression Matching in the Wild (2010), \n                  \n                    http:\/\/swtch.com\/~rsc\/regexp\/regexp3.html"},{"issue":"2","key":"25_CR4","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 Infomatica\u00a037(2), 121\u2013144 (2000)","journal-title":"Acta Infomatica"},{"key":"25_CR5","unstructured":"Fowler, G.: An Iterpretation of the POSIX Regex Standard (2003), \n                  \n                    http:\/\/www2.research.att.com\/~gsf\/testregex\/re-interpretation.html"},{"key":"25_CR6","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)"},{"issue":"5","key":"25_CR7","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 Mathematical Surveys\u00a016(5), 1\u201353 (1961)","journal-title":"Russian Mathematical Surveys"},{"key":"25_CR8","unstructured":"Kuklewicz, C.: Regular Expressions: Bounded Space Proposal (2007), \n                  \n                    http:\/\/www.haskell.org\/haskellwiki\/Regular_expressions\/Bounded_space_proposal"},{"key":"25_CR9","unstructured":"Laurikari, V.: Efficient Submatch Addressing for Regular Expressions. Master\u2019s thesis, Helsinki University of Technology (2001)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R. McNaughton","year":"1960","unstructured":"McNaughton, R., Yamada, H.: Regular Expressions and State Graphs for Automata. IEEE Transactions on Electronic Computers\u00a09, 39\u201347 (1960)","journal-title":"IEEE Transactions on Electronic Computers"},{"issue":"3","key":"25_CR11","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 Transactions on Programming Languages and Systems\u00a028(3), 389\u2013428 (2006)","journal-title":"ACM Transactions on Programming Languages and Systems"}],"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_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T02:19:46Z","timestamp":1553393986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}