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]

Authors

Dmitry Itsykson

This author has not been identified. Look up 'Dmitry Itsykson' in Google

Alexander Okhotin

This author has not been identified. Look up 'Alexander Okhotin' in Google

Vsevolod Oparin

This author has not been identified. Look up 'Vsevolod Oparin' in Google