scientific article; zbMATH DE number 4108170

MaRDI QIDQ3832063zbMATH OpenFDO

Authors Maxime Crochemore, Dominique Perrin

Publication date 1988

zbMATH Keywords

combinatorics of wordsmaximal suffices

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Recommendations

• Partial words and the critical factorization theorem revisited
• Density of Critical Factorizations
• Critical factorisation in square-free words
• A multidimensional critical factorization theorem
• Partial words and the critical factorization theorem

Cited in

(8)

• A multidimensional critical factorization theorem
• Enumerating words with forbidden factors
• Words and repeated factors
• Multiple factorizations of words and defect effect
• Partial words and the critical factorization theorem revisited
• Critical factorisation in square-free words
• Factorizing words over an ordered alphabet
• A characterization of the words occurring as factors in a minimum number of words

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 Q3832063)