Unavoidable sets of words of uniform length
type: Item
instance of: scholarly article
title: Unavoidable sets of words of uniform length
zbMATH Open document ID: 1009.68105
author: C. J. Saker
author: Peter M. Higgins
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 1853248
MaRDI profile type: Publication
full work available at URL: inco.2001.3123
OpenAlex ID: W2090661785
cites work: On extendibility of unavoidable sets
cites work: An optimal test on finite unavoidable sets of words
cites work: Q3659988
cites work: Q4529547
cites work: Q3277522
cites work: Unavoidable languages, cuts and innocent sets of words
cites work: On the synchronizing properties of certain prefix codes
DOI: 10.1006/INCO.2001.3123
description: scientific article; zbMATH DE number 1853248