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:
“You know when there’s a star, like in show business, the star has her name in lights on the marquee! Right? And the star gets the money because the people come to see the star, right? Well, I’m the star, and all of you are in the chorus.”
—Babe Didrikson Zaharias (1911–1956)
“To achieve harmony in bad taste is the height of elegance.”
—Jean Genet (1910–1986)