scientific article; zbMATH DE number 1786461

zbMATH Open0990.68051MaRDI QIDQ4547752FDOQ4547752

Christine E. Heitsch

Publication date: 21 August 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2089/20890219

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Combinatorics on words (68R15)

Cited In (1)

• The complexity of unavoidable word patterns

   Recommendations

• Insufficiency of four known necessary conditions on string unavoidability 👍 👎
• On long words avoiding Zimin patterns 👍 👎
• On Long Words Avoiding Zimin Patterns 👍 👎
• Tower-type bounds for unavoidable patterns in words 👍 👎
• Testing avoidability on sets of partial words is hard 👍 👎

This page was built for publication:

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