Document Open Access Logo

Hardness Results for Constant-Free Pattern Languages and Word Equations

Author Aleksi Saarela

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2020.140.pdf
  • Filesize: 415 kB
  • 15 pages

Document Identifiers

Author Details

Aleksi Saarela
  • Department of Mathematics and Statistics, University of Turku, Finland

Cite AsGet BibTex

Aleksi Saarela. Hardness Results for Constant-Free Pattern Languages and Word Equations. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 140:1-140:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.ICALP.2020.140

Abstract

We study constant-free versions of the inclusion problem of pattern languages and the satisfiability problem of word equations. The inclusion problem of pattern languages is known to be undecidable for both erasing and nonerasing pattern languages, but decidable for constant-free erasing pattern languages. We prove that it is undecidable for constant-free nonerasing pattern languages. The satisfiability problem of word equations is known to be in PSPACE and NP-hard. We prove that the nonperiodic satisfiability problem of constant-free word equations is NP-hard. Additionally, we prove a polynomial-time reduction from the satisfiability problem of word equations to the problem of deciding whether a given constant-free equation has a solution morphism α such that α(xy) ≠ α(yx) for given variables x and y.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Combinatorics on words
Keywords
  • Combinatorics on words
  • pattern language
  • word equation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Dana Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21(1):46-62, 1980. URL: https://doi.org/10.1016/0022-0000(80)90041-0.
  2. Evelyne Barbin-Le Rest and Michel Le Rest. Sur la combinatoire des codes à deux mots. Theoretical Computer Science, 41(1):61-80, 1985. URL: https://doi.org/10.1016/0304-3975(85)90060-X.
  3. Jean Berstel, Dominique Perrin, and Christophe Reutenauer. Codes and Automata. Cambridge University Press, 2010. Google Scholar
  4. Joachim Bremer and Dominik D. Freydenberger. Inclusion problems for patterns with a bounded number of variables. Information and Computation, 220/221:15-43, 2012. URL: https://doi.org/10.1016/j.ic.2012.10.003.
  5. Christian Choffrut and Juhani Karhumäki. Combinatorics of words. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages, volume 1, pages 329-438. Springer, 1997. URL: https://doi.org/10.1007/978-3-642-59136-5_6.
  6. Joel D. Day, Florin Manea, and Dirk Nowotka. The hardness of solving simple word equations. In Proceedings of the 42nd MFCS, volume 83 of LIPIcs, pages 18:1-14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.MFCS.2017.18.
  7. Robert Da̧browski and Wojtek Plandowski. Solving two-variable word equations (extended abstract). In Proceedings of the 31st ICALP, volume 3142 of LNCS, pages 408-419. Springer, 2004. URL: https://doi.org/10.1007/978-3-540-27836-8_36.
  8. Volker Diekert. Makanin’s algorithm. In M. Lothaire, editor, Algebraic Combinatorics on Words, pages 387-442. Cambridge University Press, 2002. Google Scholar
  9. Volker Diekert and Murray Elder. Solutions of twisted word equations, EDT0L languages, and context-free groups. In Proceedings of the 44th ICALP, volume 80 of LIPIcs, pages 96:1-14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.96.
  10. Henning Fernau and Markus L. Schmid. Pattern matching with variables: a multivariate complexity analysis. Information and Computation, 242:287-305, 2015. URL: https://doi.org/10.1016/j.ic.2015.03.006.
  11. Dominik D. Freydenberger and Daniel Reidenbach. Bad news on decision problems for patterns. Information and Computation, 208(1):83-96, 2010. URL: https://doi.org/10.1016/j.ic.2009.04.002.
  12. Tero Harju and Juhani Karhumäki. The equivalence problem of multitape finite automata. Theoretical Computer Science, 78(2):347-355, 1991. URL: https://doi.org/10.1016/0304-3975(91)90356-7.
  13. Tero Harju, Juhani Karhumäki, and Wojciech Plandowski. Independent systems of equations. In M. Lothaire, editor, Algebraic Combinatorics on Words, pages 443-472. Cambridge University Press, 2002. Google Scholar
  14. Ju. I. Hmelevskiĭ. Equations in free semigroups. American Mathematical Society, 1976. Translated by G. A. Kandall from the Russian original: Trudy Mat. Inst. Steklov. 107 (1971). Google Scholar
  15. Artur Jeż. One-variable word equations in linear time. Algorithmica, 74(1):1-48, 2016. URL: https://doi.org/10.1007/s00453-014-9931-3.
  16. Artur Jeż. Recompression: a simple and powerful technique for word equations. Journal of the ACM, 63(1):Art. 4, 51, 2016. URL: https://doi.org/10.1145/2743014.
  17. Artur Jeż. Word equations in nondeterministic linear space. In Proceedings of the 44th ICALP, volume 80 of LIPIcs, pages 95:1-13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.95.
  18. Tao Jiang, Arto Salomaa, Kai Salomaa, and Sheng Yu. Decision problems for patterns. Journal of Computer and System Sciences, 50(1):53-63, 1995. URL: https://doi.org/10.1006/jcss.1995.1006.
  19. Juhani Karhumäki, Filippo Mignosi, and Wojciech Plandowski. The expressibility of languages and relations by word equations. Journal of the ACM, 47(3):483-505, 2000. URL: https://doi.org/10.1145/337244.337255.
  20. Juhani Karhumäki and Wojciech Plandowski. On the defect effect of many identities in free semigroups. In Gheorghe Paun, editor, Mathematical aspects of natural and formal languages, pages 225-232. World Scientific, 1994. URL: https://doi.org/10.1142/9789814447133_0012.
  21. M. Lothaire. Algebraic Combinatorics on Words. Cambridge University Press, 2002. URL: http://www-igm.univ-mlv.fr/~berstel/Lothaire/AlgCWContents.html.
  22. Roger C. Lyndon and Marcel-Paul Schützenberger. The equation a^M = b^Nc^P in a free group. The Michigan Mathematical Journal, 9(4):289-298, 1962. URL: https://doi.org/10.1307/mmj/1028998766.
  23. G. S. Makanin. The problem of the solvability of equations in a free semigroup. Mat. Sb. (N.S.), 103(2):147-236, 1977. English translation in Math. USSR Sb. 32:129-198, 1977. Google Scholar
  24. Florin Manea and Markus L. Schmid. Matching patterns with variables. In Proceedings of the 12th WORDS, volume 11682 of LNCS, pages 1-27. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-28796-2_1.
  25. Yen Kaow Ng and Takeshi Shinohara. Developments from enquiries into the learnability of the pattern languages from positive data. Theoretical Computer Science, 397(1-3):150-165, 2008. URL: https://doi.org/10.1016/j.tcs.2008.02.028.
  26. Dirk Nowotka and Aleksi Saarela. An optimal bound on the solution sets of one-variable word equations and its consequences. In Proceedings of the 45th ICALP, volume 107 of LIPIcs, pages 136:1-136:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.ICALP.2018.136.
  27. Wojciech Plandowski. Satisfiability of word equations with constants is in PSPACE. Journal of the ACM, 51(3):483-496, 2004. Google Scholar
  28. Daniel Reidenbach. Discontinuities in pattern inference. Theoretical Computer Science, 397(1-3):166-193, 2008. URL: https://doi.org/10.1016/j.tcs.2008.02.029.
  29. John Michael Robson and Volker Diekert. On quadratic word equations. In Proceedings of the 16th STACS, volume 1563 of LNCS, pages 217-226. Springer, 1999. URL: https://doi.org/10.1007/3-540-49116-3_20.
  30. Aleksi Saarela. On the complexity of Hmelevskii’s theorem and satisfiability of three unknown equations. In Proceedings of the 13th DLT, volume 5583 of LNCS, pages 443-453. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-02737-6_36.
  31. Aleksi Saarela. Studying word equations by a method of weighted frequencies. Fundamenta Informaticae, 162(2-3):223-235, 2018. URL: https://doi.org/10.3233/FI-2018-1722.
  32. Géraud Sénizergues. The equivalence problem for deterministic pushdown automata is decidable. In Proceedings of the 24th ICALP, volume 1256 of LNCS, pages 671-681. Springer, 1997. URL: https://doi.org/10.1007/3-540-63165-8_221.
  33. Takeshi Shinohara. Polynomial time inference of extended regular pattern languages. In RIMS Symposia on Software Science and Engineering, volume 147 of LNCS, pages 115-127. Springer, 1983. URL: https://doi.org/doi.org/10.1007/3-540-11980-9_19.
  34. Jean-Claude Spehner. Quelques problémes d'extension, de conjugaison et de présentation des sous-monoïdes d'un monoïde libre. PhD thesis, Univ. Paris, 1976. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact