{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T03:50:35Z","timestamp":1787629835913,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319986531","type":"print"},{"value":"9783319986548","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_22","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"269-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Matching Generalised Repetitive Patterns"],"prefix":"10.1007","author":[{"given":"Joel D.","family":"Day","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pamela","family":"Fleischmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florin","family":"Manea","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dirk","family":"Nowotka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus L.","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jda.2006.10.001","volume":"5","author":"A Amir","year":"2007","unstructured":"Amir, A., Nor, I.: Generalized function matching. J. Discrete Algorithms 5, 514\u2013523 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"22_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. J. Comput. Syst. Sci. 21, 46\u201362 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/2389241.2389250","volume":"37","author":"P Barcel\u00f3","year":"2012","unstructured":"Barcel\u00f3, P., Libkin, L., Lin, A.W., Wood, P.T.: Expressive languages for path queries over graph-structured data. ACM Trans. Database Syst. 37, 31 (2012)","journal-title":"ACM Trans. Database Syst."},{"key":"22_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. J. Found. Comput. Sci. 14, 1007\u20131018 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"22_CR5","unstructured":"Day, J.D., Fleischmann, P., Manea, F., Nowotka, D.: Local patterns. In: Proceedings of 37th FSTTCS, Volume 93 of LIPIcs, pp. 24:1\u201324:14 (2017)"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0304-3975(00)00136-5","volume":"261","author":"T Erlebach","year":"2001","unstructured":"Erlebach, T., Rossmanith, P., Stadtherr, H., Steger, A., Zeugmann, T.: Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Theor. Comput. Sci. 261, 119\u2013156 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR7","unstructured":"Fernau, H., Manea, F., Merca\u015f, R., Schmid, M.L.: Pattern matching with variables: fast algorithms and new hardness results. In: Proceedings of 32nd STACS, Volume 30 of LIPIcs, pp. 302\u2013315 (2015)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-38905-4_10","volume-title":"Combinatorial Pattern Matching","author":"H Fernau","year":"2013","unstructured":"Fernau, H., Schmid, M.L.: Pattern matching with variables: a multivariate complexity analysis. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 83\u201394. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-38905-4_10"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.ic.2015.03.006","volume":"242","author":"H Fernau","year":"2015","unstructured":"Fernau, H., Schmid, M.L.: Pattern matching with variables: a multivariate complexity analysis. Inf. Comput. 242, 287\u2013305 (2015)","journal-title":"Inf. Comput."},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s00224-015-9635-3","volume":"59","author":"H Fernau","year":"2016","unstructured":"Fernau, H., Schmid, M.L., Villanger, Y.: On the parameterised complexity of string morphism problems. Theory Comput. Syst. 59(1), 24\u201351 (2016)","journal-title":"Theory Comput. Syst."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00224-012-9389-0","volume":"53","author":"DD Freydenberger","year":"2013","unstructured":"Freydenberger, D.D.: Extended regular expressions: succinctness and decidability. Theory Comput. Syst. 53, 159\u2013193 (2013)","journal-title":"Theory Comput. Syst."},{"key":"22_CR12","volume-title":"Mastering Regular Expressions","author":"JEF Friedl","year":"2006","unstructured":"Friedl, J.E.F.: Mastering Regular Expressions, 3rd edn. O\u2019Reilly, Sebastopol (2006)","edition":"3"},{"issue":"1","key":"22_CR13","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s00224-017-9794-5","volume":"62","author":"P Gawrychowski","year":"2018","unstructured":"Gawrychowski, P., Tomohiro, I., Inenaga, S., K\u00f6ppl, D., Manea, F.: Tighter bounds and optimal algorithms for all maximal \n                    \n                      \n                    \n                    $$\\alpha $$\n                  -gapped repeats and palindromes. Theory Comput. Syst. 62(1), 162\u2013191 (2018)","journal-title":"Theory Comput. Syst."},{"key":"22_CR14","unstructured":"Gawrychowski, P., Manea, F., Nowotka, D.: Testing generalised freeness of words. In: Proceedings of 31st STACS, Volume 25 of LIPIcs, pp. 337\u2013349 (2014)"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1145\/337244.337255","volume":"47","author":"J Karhum\u00e4ki","year":"2000","unstructured":"Karhum\u00e4ki, J., Plandowski, W., Mignosi, F.: The expressibility of languages and relations by word equations. J. ACM 47, 483\u2013505 (2000)","journal-title":"J. ACM"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Kearns, M., Pitt, L.: A polynomial-time algorithm for learning \n                    \n                      \n                    \n                    $$k$$\n                  -variable pattern languages from examples. In: Proceedings of 2nd COLT, pp. 57\u201371 (1989)","DOI":"10.1016\/B978-0-08-094829-4.50007-6"},{"key":"22_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.jcss.2016.11.003","volume":"85","author":"F Manea","year":"2017","unstructured":"Manea, F., M\u00fcller, M., Nowotka, D., Seki, S.: The extended equation of Lyndon and Sch\u00fctzenberger. J. Comput. Syst. Sci. 85, 132\u2013167 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-662-53132-7_25","volume-title":"Developments in Language Theory","author":"F Manea","year":"2016","unstructured":"Manea, F., Nowotka, D., Schmid, M.L.: On the solvability problem for restricted classes of word equations. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 306\u2013318. Springer, Heidelberg (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-662-53132-7_25"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1051\/ita\/1994283-402331","volume":"28","author":"A Mateescu","year":"1994","unstructured":"Mateescu, A., Salomaa, A.: Finite degrees of ambiguity in pattern languages. RAIRO Informatique Th\u00e9oretique et Appl. 28, 233\u2013253 (1994)","journal-title":"RAIRO Informatique Th\u00e9oretique et Appl."},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.tcs.2008.02.028","volume":"397","author":"YK Ng","year":"2008","unstructured":"Ng, Y.K., Shinohara, T.: Developments from enquiries into the learnability of the pattern languages from positive data. Theor. Comput. Sci. 397, 150\u2013165 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-13524-3_23","volume-title":"Parameterized and Exact Computation","author":"S Ordyniak","year":"2014","unstructured":"Ordyniak, S., Popa, A.: A parameterized study of maximum generalized pattern matching problems. In: Cygan, M., Heggernes, P. (eds.) IPEC 2014. LNCS, vol. 8894, pp. 270\u2013281. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-13524-3_23"},{"key":"22_CR23","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tcs.2008.02.029","volume":"397","author":"D Reidenbach","year":"2008","unstructured":"Reidenbach, D.: Discontinuities in pattern inference. Theor. Comput. Sci. 397, 166\u2013193 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ic.2014.08.010","volume":"239","author":"D Reidenbach","year":"2014","unstructured":"Reidenbach, D., Schmid, M.L.: Patterns with bounded treewidth. Inf. Comput. 239, 87\u201399 (2014)","journal-title":"Inf. Comput."},{"key":"22_CR25","unstructured":"Shinohara, T.: Polynomial time inference of pattern languages and its application. In: Proceedings of 7th IBM MFCS, pp. 191\u2013209 (1982)"}],"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-98654-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T19:13:37Z","timestamp":1535915617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}