Enumerating words with forbidden factors

DOI10.1016/J.ENDM.2019.02.003MaRDI QIDQ1739941zbMATH OpenOpenAlexFDO

Authors Richard Pinch

Publication date 29 April 2019

Full work available at URL https://doi.org/10.1016/j.endm.2019.02.003

zbMATH Keywords

power seriesrecurrence relationprefix normal wordforbidden factor

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• scientific article; zbMATH DE number 1408358
• Recursive formula of enumeration on forbidden words
• Words and forbidden factors
• scientific article; zbMATH DE number 1870556
• scientific article; zbMATH DE number 2051157
• Enumeration of factors in the Thue-Morse word
• scientific article; zbMATH DE number 5557896
• A recurrence algorithm of enumeration on only one forbidden word
• Counting maximal-exponent factors in words
• scientific article; zbMATH DE number 4108170

Cites work

• scientific article; zbMATH DE number 721909 (Why is no real title available?)
• Generating necklaces
• On prefix normal words and prefix normal forms

Cited in

(2)

• Recursive formula of enumeration on forbidden words
• Word assembly through minimal forbidden words

This page was built for publication: Enumerating words with forbidden factors

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