Computational and Proof Complexity of Partial String Avoidability

The partial string avoidability problem is stated as follows: given a finite set of strings with possible “holes” (wildcard symbols), determine whether there exists a two-sided infinite string containing no substrings from this set, assuming that a hole matches every symbol. The problem is known to...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	ACM transactions on computation theory 2021-03, Vol.13 (1), p.1-25, Article 6
Hauptverfasser:	Itsykson, Dmitry, Okhotin, Alexander, Oparin, Vsevolod
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Combinatorics on words Computational complexity and cryptography Discrete mathematics Mathematics of computing Problems, reductions and completeness Proof complexity Theory of computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!