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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.