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:
“For a painter, the Mecca of the world, for study, for inspiration and for living is here on this star called Paris. Just look at it, no wonder so many artists have come here and called it home. Brother, if you can’t paint in Paris, you’d better give up and marry the boss’s daughter.”
—Alan Jay Lerner (1918–1986)
“The Woodrovian style, at the height of the Wilson hallucination, was much praised by cornfed connoisseurs.”
—H.L. (Henry Lewis)