A string or word is said to be admissible if that word appears in a given Sequence. For example, in the Sequence , , , are all admissible, but is inadmissible.