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.
Admissible
See also
Block GrowthExplore with Wolfram|Alpha
Cite this as:
Weisstein, Eric W. "Admissible." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Admissible.html