Insufficiency of four known necessary conditions on string unavoidability

DOI10.1016/J.JALGOR.2004.07.010MaRDI QIDQ5692273zbMATH OpenOpenAlexFDO

Authors Christine E. Heitsch

Publication date 28 September 2005

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.07.010

zbMATH Keywords

reductive decision procedure

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1786461
• scientific article; zbMATH DE number 4072416
• Testing avoidability on sets of partial words is hard
• Unavoidable Set: Extension and Reduction
• Computational and proof complexity of partial string avoidability

Cited in

(1)

• scientific article; zbMATH DE number 1786461 (Why is no real title available?)

This page was built for publication: Insufficiency of four known necessary conditions on string unavoidability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692273)