Computational and Proof Complexity of Partial String Avoidability

Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin. Computational and Proof Complexity of Partial String Avoidability. TOCT, 13(1), 2021. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: