{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:00Z","timestamp":1759639080966},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096971"},{"type":"electronic","value":"9783319096988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09698-8_13","type":"book-chapter","created":{"date-parts":[[2014,8,18]],"date-time":"2014-08-18T00:52:51Z","timestamp":1408323171000},"page":"142-153","source":"Crossref","is-referenced-by-count":0,"title":["Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing"],"prefix":"10.1007","author":[{"given":"Markus L.","family":"Schmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","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":"13_CR2","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":"13_CR3","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":"13_CR4","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. Int. Journal of Foundations of Computer Science\u00a014, 1007\u20131018 (2003)","journal-title":"Int. Journal of Foundations of Computer Science"},{"key":"13_CR5","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":"13_CR6","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":"13_CR7","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":"13_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J. Dassow","year":"1989","unstructured":"Dassow, J., P\u0103un, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Dassow, J., P\u0103un, G., Salomaa, A.: Grammars with controlled derivations. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a02, pp. 101\u2013154. Springer (1997)","DOI":"10.1007\/978-3-662-07675-0_3"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1145\/368834.368898","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: On the nonexistence of a phrase structure grammar for algol 60. Communications of the ACM\u00a05, 483\u2013484 (1962)","journal-title":"Communications of the ACM"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00224-012-9389-0","volume":"53","author":"D.D. Freydenberger","year":"2013","unstructured":"Freydenberger, D.D.: Extended regular expressions: Succinctness and decidability. Theory of Computing Systems\u00a053, 159\u2013193 (2013)","journal-title":"Theory of Computing Systems"},{"key":"13_CR12","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":"13_CR13","doi-asserted-by":"crossref","unstructured":"Kallmeyer, L.: Parsing Beyond Context-Free Grammars. Springer (2010)","DOI":"10.1007\/978-3-642-14846-0"},{"key":"13_CR14","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.\u00a05, pp. 253\u2013328. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_5"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00236-002-0099-y","volume":"39","author":"G.D. Penna","year":"2003","unstructured":"Penna, G.D., Intrigila, B., Tronci, E., Zilli, M.V.: Synchronized regular expressions. Acta Informatica\u00a039, 31\u201370 (2003)","journal-title":"Acta Informatica"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1142\/S0129054113400340","volume":"24","author":"M.L. Schmid","year":"2013","unstructured":"Schmid, M.L.: Inside the class of regex languages. International Journal of Foundations of Computer Science\u00a024, 1117\u20131134 (2013)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, ch.\u00a02, 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-319-09698-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:07:19Z","timestamp":1558973239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09698-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096971","9783319096988"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09698-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}