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]

@article{ItsyksonOO21,
  title = {Computational and Proof Complexity of Partial String Avoidability},
  author = {Dmitry Itsykson and Alexander Okhotin and Vsevolod Oparin},
  year = {2021},
  doi = {10.1145/3442365},
  url = {https://doi.org/10.1145/3442365},
  researchr = {https://researchr.org/publication/ItsyksonOO21},
  cites = {0},
  citedby = {0},
  journal = {TOCT},
  volume = {13},
  number = {1},
}