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:
“My advice to those who think they have to take off their clothes to be a star is, once you’re boned, what’s left to create the illusion? Let ‘em wonder. I never believed in givin’ them too much of me.”
—Mae West (1892–1980)
“I cannot help wondering sometimes what I might have become and might have done if I had lived in a country which had not circumscribed and handicapped me on account of my race, but had allowed me to reach any height I was able to attain.”
—Mary Church Terrell (1863–1954)