Unavoidable Sets of Words of Uniform Length

ISSN： 0890-5401

Source： Information and Computation, Vol.173, Iss.2, 2002-03, pp. : 222-226

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Unavoidable regularities in long words with bounded number of symbol occurrences

By Kortelainen Juha Kortelainen Tuomas Vesanen Ari

Journal of Combinatorial Optimization, Vol. 26, Iss. 4, 2013-11 ,pp. : 670-686

Springer Publishing Company

Access to resources Recommend Favorite

Star-Free Sets of Words on Ordinals

By Bedon N.

Information and Computation, Vol. 166, Iss. 2, 2001-05 ,pp. : 93-111

Academic Press

Access to resources Recommend Favorite

The Number of Words of a Given Length in the Planar Crystallographic Groups

By Shutov A.

Journal of Mathematical Sciences, Vol. 129, Iss. 3, 2005-09 ,pp. : 3922-3926

Springer Publishing Company

Access to resources Recommend Favorite

Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs

By Krivelevich M. Nathaniel R. Sudakov B.

Journal of Algorithms, Vol. 41, Iss. 1, 2001-10 ,pp. : 99-113

Academic Press

Access to resources Recommend Favorite

Chen-Fox-Lyndon Factorization for Words over Partially Ordered Sets

By Hazewinkel M.

Journal of Mathematical Sciences, Vol. 131, Iss. 6, 2005-12 ,pp. : 6027-6031

Springer Publishing Company

Access to resources Recommend Favorite