Partitioning Subwords of Long Words

DOI10.1016/S0304-0208(08)73397-8MaRDI QIDQ3315512zbMATH OpenFDO

Authors Walter A. Deuber

Publication date 1983

Published in Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-0208(08)73397-8

zbMATH Keywords

finite alphabetinfinite subsetset of all subwords

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Density, gaps, topology (11B05) Elementary theory of partitions (11P81)

Recommendations

• Partitions of factorisations of parameter words
• scientific article; zbMATH DE number 3922981
• scientific article; zbMATH DE number 4168694
• Coloring problems for infinite words
• scientific article; zbMATH DE number 3873610

Cited in

(8)

• Density versions of two generalizations of Schur's theorem
• Defining long words succinctly in FO and MSO
• Partition theorems for left and right variable words
• Characterization of a word by its subwords
• ON PARTITIONS SEPARATING WORDS
• scientific article; zbMATH DE number 4168694 (Why is no real title available?)
• On additive properties of sets defined by the Thue-Morse word
• Partitions of factorisations of parameter words

This page was built for publication: Partitioning Subwords of Long Words

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