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:
“Exhaust them, wrestle with them, let them not go until their blessing be won, and, after a short season, the dismay will be overpast, the excess of influence withdrawn, and they will be no longer an alarming meteor, but one more brighter star shining serenely in your heaven, and blending its light with all your day.”
—Ralph Waldo Emerson (1803–1882)
“The most stupendous scenery ceases to be sublime when it becomes distinct, or in other words limited, and the imagination is no longer encouraged to exaggerate it. The actual height and breadth of a mountain or a waterfall are always ridiculously small; they are the imagined only that content us.”
—Henry David Thoreau (1817–1862)