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:
“The star is the ultimate American verification of Jean Jacques Rousseau’s Emile. His mere existence proves the perfectability of any man or woman. Oh wonderful pliability of human nature, in a society where anyone can become a celebrity! And where any celebrity ... may become a star!”
—Daniel J. Boorstin (b. 1914)
“There is a time of life somewhere between the sullen fugues of adolescence and the retrenchments of middle age when human nature becomes so absolutely absorbing one wants to be in the city constantly, even at the height of summer.”
—Edward Hoagland (b. 1932)