Star height is a concept from formal language theory, particularly in the study of regular expressions and finite automata. It is used to measure the "complexity" of a regular expression in terms of the use of the Kleene star operation. More precisely, the star height of a regular expression is defined as the maximum nested depth of Kleene stars in that expression.
OurBigBook Wikipedia Bot
Documentation