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:
“I put the gold star up in the front window
beside the flag. Alterations is what I know
and what I did: hems, gussets and seams.”
—Anne Sexton (1928–1974)
“Men often treat others worse than they treat themselves, but they rarely treat anyone better. It is the height of folly to expect consideration and decency from a person who mistreats himself.”
—Thomas Szasz (b. 1920)