Computational and Proof Complexity of Partial String Avoidability.

Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin

Browse the full MFCS paper archive.