{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:35Z","timestamp":1725577415620},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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_26","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"241-250","source":"Crossref","is-referenced-by-count":9,"title":["A Polynomial Time Match Test for Large Classes of Extended Regular Expressions"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Reidenbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus L.","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Algorithms and Complexity","first-page":"255","volume-title":"Handbook of Theoretical Computer Science","author":"A. Aho","year":"1990","unstructured":"Aho, A.: Algorithms for finding patterns in strings. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Algorithms and Complexity, vol.\u00a0A, pp. 255\u2013300. MIT Press, Cambridge (1990)"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences\u00a021, 46\u201362 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1142\/S012905410300214X","volume":"14","author":"C. C\u00e2mpeanu","year":"2003","unstructured":"C\u00e2mpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. International Journal of Foundations of Computer Science\u00a014, 1007\u20131018 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0020-0190(79)90135-2","volume":"9","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Finding a homomorphism between two words is NP-complete. Information Processing Letters\u00a09, 86\u201388 (1979)","journal-title":"Information Processing Letters"},{"key":"26_CR5","volume-title":"Mastering Regular Expressions","author":"J.E.F. Friedl","year":"2006","unstructured":"Friedl, J.E.F.: Mastering Regular Expressions, 3rd edn. O\u2019Reilly, Sebastopol (2006)","edition":"3"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-0-387-26677-0","volume-title":"Unsolved Problems in Number Theory","author":"R.K. Guy","year":"2004","unstructured":"Guy, R.K.: The money changing problem. In: Unsolved Problems in Number Theory, 3rd edn., ch.\u00a0C7, pp. 171\u2013173. Springer, New York (2004)","edition":"3"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/S0022-0000(73)80048-0","volume":"7","author":"O. Ibarra","year":"1973","unstructured":"Ibarra, O.: On two-way multihead automata. Journal of Computer and System Sciences\u00a07, 28\u201336 (1973)","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O. Ibarra","year":"1978","unstructured":"Ibarra, O.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM\u00a025, 116\u2013133 (1978)","journal-title":"Journal of the ACM"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0167-8655(94)00091-G","volume":"16","author":"O. Ibarra","year":"1995","unstructured":"Ibarra, O., Pong, T.-C., Sohn, S.: A note on parsing pattern languages. Pattern Recognition Letters\u00a016, 179\u2013182 (1995)","journal-title":"Pattern Recognition Letters"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/00207169408804252","volume":"50","author":"T. Jiang","year":"1994","unstructured":"Jiang, T., Kinber, E., Salomaa, A., Salomaa, K., Yu, S.: Pattern languages with and without erasing. International Journal of Computer Mathematics\u00a050, 147\u2013163 (1994)","journal-title":"International Journal of Computer Mathematics"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-11980-9_19","volume-title":"RIMS Symposium on Software Science and Engineering","author":"T. Shinohara","year":"1983","unstructured":"Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Goto, E., Furukawa, K., Nakajima, R., Nakata, I., Yonezawa, A. (eds.) RIMS 1982. LNCS, vol.\u00a0147, pp. 115\u2013127. Springer, Heidelberg (1983)"},{"key":"26_CR12","unstructured":"Shinohara, T.: Polynomial time inference of pattern languages and its application. In: Proc. 7th IBM MFCS, pp. 191\u2013209 (1982)"}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T02:41:59Z","timestamp":1553395319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}