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 must down to the seas again, to the lonely sea and the sky,
And all I ask is a tall ship and a star to steer her by,”
—John Masefield (1878–1967)
“We have not the motive to prepare ourselves for a “life-work” of teaching, of social work—we know that we would lay it down with hallelujah in the height of our success, to make a home for the right man. And all the time in the background of our consciousness rings the warning that perhaps the right man will never come. A great love is given to very few. Perhaps this make-shift time filler of a job is our life work after all.”
—Ruth Benedict (1887–1948)