{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:48Z","timestamp":1759638948740},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_8","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:51:39Z","timestamp":1342259499000},"page":"73-84","source":"Crossref","is-referenced-by-count":3,"title":["Inside the Class of REGEX Languages"],"prefix":"10.1007","author":[{"given":"Markus L.","family":"Schmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","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 (1990)","DOI":"10.1016\/B978-0-444-88071-0.50010-2"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(81)90100-6","volume":"16","author":"J. Albert","year":"1981","unstructured":"Albert, J., Wegner, L.: Languages with homomorphic replacements. Theoretical Computer Science\u00a016, 291\u2013305 (1981)","journal-title":"Theoretical Computer Science"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Finding patterns common to a set of strings. In: Proc. 11th Annual ACM Symposium on Theory of Computing, pp. 130\u2013141 (1979)","DOI":"10.1145\/800135.804406"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1051\/ita\/2010013","volume":"44","author":"H. Bordihn","year":"2010","unstructured":"Bordihn, H., Dassow, J., Holzer, M.: Extending regular expressions with homomorphic replacement. RAIRO Theoretical Informatics and Applications\u00a044, 229\u2013255 (2010)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"8_CR5","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":"8_CR6","doi-asserted-by":"publisher","first-page":"2336","DOI":"10.1016\/j.tcs.2009.02.022","volume":"410","author":"C. C\u00e2mpeanu","year":"2009","unstructured":"C\u00e2mpeanu, C., Santean, N.: On the intersection of regex languages with regular languages. Theoretical Computer Science\u00a0410, 2336\u20132344 (2009)","journal-title":"Theoretical Computer Science"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.ipl.2004.09.007","volume":"92","author":"C. C\u00e2mpeanu","year":"2004","unstructured":"C\u00e2mpeanu, C., Yu, S.: Pattern expressions and pattern automata. Information Processing Letters\u00a092, 267\u2013274 (2004)","journal-title":"Information Processing Letters"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-00982-2_24","volume-title":"Language and Automata Theory and Applications","author":"B. Carle","year":"2009","unstructured":"Carle, B., Narendran, P.: On Extended Regular Expressions. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 279\u2013289. Springer, Heidelberg (2009)"},{"key":"8_CR9","unstructured":"Freydenberger, D.D.: Extended regular expressions: Succinctness and decidability. In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. LIPIcs, vol.\u00a09, pp. 507\u2013518 (2011)"},{"key":"8_CR10","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":"8_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2010.08.024","volume":"412","author":"M. Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions. Theoretical Computer Science\u00a0412, 83\u201396 (2011)","journal-title":"Theoretical Computer Science"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Kari, L., Rozenberg, G., Salomaa, A.: L systems. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, ch. 5, pp. 253\u2013328. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_5"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies. Annals of Mathematics Studies, vol.\u00a034, pp. 3\u201341. Princeton University Press (1956)","DOI":"10.1515\/9781400882618-002"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0020-0190(98)00007-6","volume":"65","author":"K.S. Larsen","year":"1998","unstructured":"Larsen, K.S.: Regular expressions with nested levels of back referencing form a hierarchy. Information Processing Letters\u00a065, 169\u2013172 (1998)","journal-title":"Information Processing Letters"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00236-002-0099-y","volume":"39","author":"G. Penna Della","year":"2003","unstructured":"Della Penna, G., Intrigila, B., Tronci, E., Venturini Zilli, M.: Synchronized regular expressions. Acta Informatica\u00a039, 31\u201370 (2003)","journal-title":"Acta Informatica"},{"key":"8_CR16","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":"8_CR17","doi-asserted-by":"crossref","unstructured":"Thompson, K.: Programming techniques: Regular expression search algorithm. Communications of the ACM\u00a011 (1968)","DOI":"10.1145\/363347.363387"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, ch. 2, pp. 41\u2013110. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31653-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:08:41Z","timestamp":1606187321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}