Skip to main content
SpringerLink
Log in

Matching Patterns with Variables Under Simon’s Congruence

  • Conference paper
  • First Online:
Reachability Problems (RP 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14235))

Included in the following conference series:

Abstract

We introduce and investigate a series of matching problems for patterns with variables under Simon’s congruence. Our results provide a thorough picture of these problems’ computational complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Adamson, D.: Ranking and unranking \(k\)-subsequence universal words. In: Frid, A., Mercaş, R. (eds.) Combinatorics on Words, WORDS 2023. LNCS, vol. 13899, pp. 47–59. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-33180-0_4

  2. Adamson, D., Kosche, M., Koß, T., Manea, F., Siemer, S.: Longest common subsequence with gap constraints. In: Frid, A., Mercaş, R. (eds.) Combinatorics on Words. WORDS 2023. Lecture Notes in Computer Science, vol. 13899, pp. 60–76. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-33180-0_5

  3. Amadini, R.: A survey on string constraint solving. ACM Comput. Surv. (CSUR) 55(1), 1–38 (2021)

    Article  Google Scholar 

  4. Amir, A., Nor, I.: Generalized function matching. J. Discrete Algorithms 5, 514–523 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21(1), 46–62 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  6. Barker, L., Fleischmann, P., Harwardt, K., Manea, F., Nowotka, D.: Scattered factor-universality of words. In: Jonoska, N., Savchuk, D. (eds.) DLT 2020. LNCS, vol. 12086, pp. 14–28. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-48516-0_2

    Chapter  Google Scholar 

  7. de Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Akademie v. Wetenschappen 49, 758–764 (1946)

    MATH  Google Scholar 

  8. Câmpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. Int. J. Found. Comput. Sci. 14, 1007–1018 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chen, H.Z.Q., Kitaev, S., Mütze, T., Sun, B.Y.: On universal partial words. Electron. Notes Discrete Math. 61, 231–237 (2017)

    Article  MATH  Google Scholar 

  10. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press (2007)

    Google Scholar 

  11. Crochemore, M., Melichar, B., Tronícek, Z.: Directed acyclic subsequence graph - overview. J. Discrete Algorithms 1(3–4), 255–280 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Day, J., Fleischmann, P., Kosche, M., Koß, T., Manea, F., Siemer, S.: The edit distance to k-subsequence universality. In: STACS, vol. 187, pp. 25:1–25:19 (2021)

    Google Scholar 

  13. Day, J.D., Fleischmann, P., Manea, F., Nowotka, D.: Local patterns. In: Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017. LIPIcs, vol. 93, pp. 24:1–24:14 (2017)

    Google Scholar 

  14. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999). https://doi.org/10.1007/978-1-4612-0515-9

  15. Fagin, R., Kimelfeld, B., Reiss, F., Vansummeren, S.: Document spanners: a formal approach to information extraction. J. ACM 62(2), 12:1–12:51 (2015)

    Google Scholar 

  16. Fernau, H., Manea, F., Mercas, R., Schmid, M.L.: Revisiting Shinohara’s algorithm for computing descriptive patterns. Theor. Comput. Sci. 733, 44–54 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  17. Fernau, H., Manea, F., Mercas, R., Schmid, M.L.: Pattern matching with variables: efficient algorithms and complexity results. ACM Trans. Comput. Theor. 12(1), 6:1–6:37 (2020)

    Google Scholar 

  18. Fernau, H., Schmid, M.L.: Pattern matching with variables: a multivariate complexity analysis. Inf. Comput. 242, 287–305 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  19. Fernau, H., Schmid, M.L., Villanger, Y.: On the parameterised complexity of string morphism problems. Theor. Comput. Syst. 59(1), 24–51 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  20. Fleischer, L., Kufleitner, M.: Testing Simon’s congruence. In: Potapov, I., Spirakis, P.G., Worrell, J. (eds.) MFCS 2018. LIPIcs, vol. 117, pp. 62:1–62:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)

    Google Scholar 

  21. Fleischmann, P., Germann, S., Nowotka, D.: Scattered factor universality-the power of the remainder. preprint arXiv:2104.09063 (published at RuFiDim) (2021)

  22. Fleischmann, P., Höfer, J., Huch, A., Nowotka, D.: \(\alpha \)-\(\beta \)-factorization and the binary case of Simon’s congruence (2023)

    Google Scholar 

  23. Fleischmann, P., et al.: Matching patterns with variables under Simon’s congruence (2023)

    Google Scholar 

  24. Freydenberger, D.D.: Extended regular expressions: succinctness and decidability. Theor. Comput. Syst. 53, 159–193 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  25. Freydenberger, D.D.: A logic for document spanners. Theor. Comput. Syst. 63(7), 1679–1754 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  26. Freydenberger, D.D., Gawrychowski, P., Karhumäki, J., Manea, F., Rytter, W.: Testing k-binomial equivalence. CoRR abs/1509.00622 (2015)

    Google Scholar 

  27. Freydenberger, D.D., Holldack, M.: Document spanners: from expressive power to decision problems. Theor. Comput. Syst. 62(4), 854–898 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  28. Freydenberger, D.D., Peterfreund, L.: The theory of concatenation over finite models. In: Bansal, N., Merelli, E., Worrell, J. (eds.) ICALP 2021, Proceedings. LIPIcs, vol. 198, pp. 130:1–130:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)

    Google Scholar 

  29. Freydenberger, D.D., Schmid, M.L.: Deterministic regular expressions with back-references. J. Comput. Syst. Sci. 105, 1–39 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  30. Friedl, J.E.F.: Mastering Regular Expressions, 3rd edn. O’Reilly, Sebastopol, CA (2006)

    Google Scholar 

  31. Garel, E.: Minimal separators of two words. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol. 684, pp. 35–53. Springer, Heidelberg (1993). https://doi.org/10.1007/BFb0029795

    Chapter  Google Scholar 

  32. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1979)

    MATH  Google Scholar 

  33. Gawrychowski, P., Kosche, M., Koß, T., Manea, F., Siemer, S.: Efficiently testing Simon’s congruence. In: STACS 2021. LIPIcs, vol. 187, pp. 34:1–34:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)

    Google Scholar 

  34. Gawrychowski, P., Lange, M., Rampersad, N., Shallit, J.O., Szykula, M.: Existential length universality. In: Proceedings of the STACS 2020. LIPIcs, vol. 154, pp. 16:1–16:14 (2020)

    Google Scholar 

  35. Gawrychowski, P., Manea, F., Siemer, S.: Matching patterns with variables under Hamming distance. In: 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021. LIPIcs, vol. 202, pp. 48:1–48:24 (2021)

    Google Scholar 

  36. Gawrychowski, P., Manea, F., Siemer, S.: Matching patterns with variables under edit distance. In: Arroyuelo, D., Poblete, B. (eds.) String Processing and Information Retrieval, SPIRE 2022. LNCS, vol. 13617, pp. 275–289. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-20643-6_20

  37. Goeckner, B., et al.: Universal partial words over non-binary alphabets. Theor. Comput. Sci. 713, 56–65 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  38. Hague, M.: Strings at MOSCA. ACM SIGLOG News 6(4), 4–22 (2019)

    Article  MathSciNet  Google Scholar 

  39. Hébrard, J.: An algorithm for distinguishing efficiently bit-strings by their subsequences. Theoret. Comput. Sci. 82(1), 35–49 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  40. Karandikar, P., Schnoebelen, P.: The height of piecewise-testable languages with applications in logical complexity. In: CSL (2016)

    Google Scholar 

  41. Karhumäki, J., Saarela, A., Zamboni, L.Q.: On a generalization of Abelian equivalence and complexity of infinite words. J. Comb. Theor. Ser. A 120(8), 2189–2206 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  42. Karhumäki, J., Saarela, A., Zamboni, L.Q.: Variations of the Morse-Hedlund theorem for k-abelian equivalence. Acta Cybern. 23(1), 175–189 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  43. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Proceedings of a Symposium on the Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85–103. Plenum Press, New York (1972). https://doi.org/10.1007/978-1-4684-2001-2_9

  44. Kim, S., Ko, S., Han, Y.: Simon’s congruence pattern matching. In: Bae, S.W., Park, H. (eds.) 33rd International Symposium on Algorithms and Computation, ISAAC 2022, 19–21 December 2022, Seoul, Korea. LIPIcs, vol. 248, pp. 60:1–60:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)

    Google Scholar 

  45. Kim, S., Han, Y.S., Ko, S.K., Salomaa, K.: On Simon’s congruence closure of a string. In: Han, Y.S., Vaszil, G. (eds.) DCFS 2022. LNCS, vol. 13439, pp. 127–141. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-13257-5_10

    Chapter  Google Scholar 

  46. Kleest-Meißner, S., Sattler, R., Schmid, M.L., Schweikardt, N., Weidlich, M.: Discovering event queries from traces: laying foundations for subsequence-queries with wildcards and gap-size constraints. In: 25th International Conference on Database Theory, ICDT 2022. LIPIcs, vol. 220, pp. 18:1–18:21 (2022)

    Google Scholar 

  47. Kosche, M., Koß, T., Manea, F., Siemer, S.: Absent subsequences in words. In: Bell, P.C., Totzke, P., Potapov, I. (eds.) RP 2021. LNCS, vol. 13035, pp. 115–131. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-89716-1_8

    Chapter  Google Scholar 

  48. Kosche, M., Koß, T., Manea, F., Siemer, S.: Combinatorial algorithms for subsequence matching: a survey. In: Bordihn, H., Horváth, G., Vaszil, G. (eds.) NCMA, vol. 367, pp. 11–27 (2022)

    Google Scholar 

  49. Krötzsch, M., Masopust, T., Thomazo, M.: Complexity of universality and related problems for partially ordered NFAs. Inf. Comput. 255, 177–192 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  50. Lejeune, M., Rigo, M., Rosenfeld, M.: The binomial equivalence classes of finite words. Int. J. Algebra Comput. 30(07), 1375–1397 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  51. Lothaire, M.: Combinatorics on Words. Cambridge University Press (1997)

    Google Scholar 

  52. Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press (2002)

    Google Scholar 

  53. Martin, M.H.: A problem in arrangements. Bull. Am. Math. Soc. 40(12), 859–864 (1934)

    Article  MathSciNet  MATH  Google Scholar 

  54. Rampersad, N., Shallit, J., Xu, Z.: The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages. Fundam. Inf. 116(1–4), 223–236 (2012)

    MathSciNet  MATH  Google Scholar 

  55. Reidenbach, D., Schmid, M.L.: Patterns with bounded treewidth. Inf. Comput. 239, 87–99 (2014). https://doi.org/10.1016/j.ic.2014.08.010

    Article  MathSciNet  MATH  Google Scholar 

  56. Rigo, M., Salimov, P.: Another generalization of abelian equivalence: binomial complexity of infinite words. Theor. Comput. Sci. 601, 47–57 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  57. Schmid, M.L.: A note on the complexity of matching patterns with variables. Inf. Process. Lett. 113(19), 729–733 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  58. Schmid, M.L., Schweikardt, N.: A purely regular approach to non-regular core spanners. In: Proceedings of the 24th International Conference on Database Theory, ICDT 2021. LIPIcs, vol. 186, pp. 4:1–4:19 (2021)

    Google Scholar 

  59. Schmid, M.L., Schweikardt, N.: Document spanners - a brief overview of concepts, results, and recent developments. In: International Conference on Management of Data, PODS 2022, pp. 139–150. ACM (2022)

    Google Scholar 

  60. Schnoebelen, P., Karandikar, P.: The height of piecewise-testable languages and the complexity of the logic of subwords. Logical Meth. Comput. Sci. 15, 6:1–6:27 (2019)

    Google Scholar 

  61. Schnoebelen, P., Veron, J.: On arch factorization and subword universality for words and compressed words. In: Frid, A., Mercaş, R. (eds.) Combinatorics on Words, WORDS 2023. LNCS, vol. 13899, pp. 274–287. Springer, Cham. https://doi.org/10.1007/978-3-031-33180-0_21

  62. Jantke, K.P.: Polynomial time inference of general pattern languages. In: Fontet, M., Mehlhorn, K. (eds.) STACS 1984. LNCS, vol. 166, pp. 314–325. Springer, Heidelberg (1984). https://doi.org/10.1007/3-540-12920-0_29

    Chapter  Google Scholar 

  63. Shinohara, T., Arikawa, S.: Pattern inference. In: Jantke, K.P., Lange, S. (eds.) Algorithmic Learning for Knowledge-Based Systems. LNCS, vol. 961, pp. 259–291. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-60217-8_13

    Chapter  Google Scholar 

  64. Simon, I.: Hierarchies of events with dot-depth one. Ph.D. thesis, University of Waterloo (1972)

    Google Scholar 

  65. Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214–222. Springer, Heidelberg (1975). https://doi.org/10.1007/3-540-07407-4_23

    Chapter  Google Scholar 

  66. Simon, I.: Words distinguished by their subwords (extended abstract). In: Proceedings of the WORDS 2003, vol. 27, pp. 6–13. TUCS General Publication (2003)

    Google Scholar 

  67. Troniĉek, Z.: Common subsequence automaton. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 270–275. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-44977-9_28

    Chapter  Google Scholar 

  68. Weis, P., Immerman, N.: Structure theorem and strict alternation hierarchy for FO\(^2\) on words. Log. Meth. Comput. Sci. 5(3), 1–23 (2009)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Kiel University, Kiel, Germany

    Pamela Fleischmann, Dirk Nowotka & Max Wiedenhöft

  2. Department of Computer Science, University of Göttingen, Göttingen, Germany

    Tore Koß, Florin Manea & Stefan Siemer

  3. Department of Computer Science, Yonsei University, Seoul, Republic of Korea

    Sungmin Kim

Authors
  1. Pamela Fleischmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sungmin Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tore Koß
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Florin Manea
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Dirk Nowotka
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Stefan Siemer
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Max Wiedenhöft
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Siemer .

Editor information

Editors and Affiliations

  1. École Polytechnique, Paris, France

    Olivier Bournez

  2. Université Côte d’Azur, Nice, France

    Enrico Formenti

  3. University of Liverpool, Liverpool, UK

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fleischmann, P. et al. (2023). Matching Patterns with Variables Under Simon’s Congruence. In: Bournez, O., Formenti, E., Potapov, I. (eds) Reachability Problems. RP 2023. Lecture Notes in Computer Science, vol 14235. Springer, Cham. https://doi.org/10.1007/978-3-031-45286-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-45286-4_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-45285-7

  • Online ISBN: 978-3-031-45286-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation