A4 Article in conference proceedings

Hardness results for constant-free pattern languages and word equations




List of Authors: Aleksi Saarela

Conference name: International Colloquium on Automata, Languages, and Programming

Publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

Publication year: 2020

Journal: LIPICS – Leibniz international proceedings in informatics

Book title *: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)

Journal name in source: Leibniz International Proceedings in Informatics, LIPIcs

Title of series: Leibniz International Proceedings in Informatics (LIPIcs)

Volume number: 168

ISBN: 978-3-95977-138-2

ISSN: 1868-8969

DOI: http://dx.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.


Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.




Last updated on 2021-24-06 at 12:02