In theoretical computer science, more precisely in the theory of formal languages, the star height is a measure for the structural complexity of regular expressions: The star height equals the maximum nesting depth of stars appearing in the regular expression. The concept of star height was first defined and studied by Eggan (1963).
Read more about Star Height: Formal Definition, Examples, Eggan's Theorem, Generalized Star Height
Famous quotes containing the words star and/or height:
“It is the star to every wandring bark,
Whose worths unknown, although his height be taken.
Loves not Times fool, though rosy lips and cheeks
Within his bending sickles compass come;
Love alters not with his brief hours and weeks,
But bears it out even to the edge of doom.”
—William Shakespeare (15641616)
“The Woodrovian style, at the height of the Wilson hallucination, was much praised by cornfed connoisseurs.”
—H.L. (Henry Lewis)