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:
“When you wish upon a star your dreams come true.”
—Ned Washington (190l–1976)
“It’s the height of folly to want to be the only wise one.”
—François, Duc De La Rochefoucauld (1613–1680)
Related Subjects
Related Phrases
Related Words