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:
“What is this flesh I purchased with my pains,
This fallen star my milk sustains,
This love that makes my heart’s blood stop
Or strikes a sudden chill into my bones
And bids my hair stand up?”
—William Butler Yeats (1865–1939)
“It would be naive to think that peace and justice can be achieved easily. No set of rules or study of history will automatically resolve the problems.... However, with faith and perseverance,... complex problems in the past have been resolved in our search for justice and peace. They can be resolved in the future, provided, of course, that we can think of five new ways to measure the height of a tall building by using a barometer.”
—Jimmy Carter (James Earl Carter, Jr.)