Unavoidable Languages, Cuts and Innocent Sets of Words

A language X on an alphabet A is unavoidable iff all but finitely many words in A * have a factor in X. In this paper, cuts (which are basically simplifications of languages in terms of avoidability) and innocent language (those which cannot be cut) are defined. Their properties, most of which are related to unavoidable languages, are studied.