The star height problem in formal language theory is the question whether all regular languages can be expressed using regular expressions of limited star height, i.e. with a limited nesting depth of Kleene stars. Specifically, is a nesting depth of one always sufficient? If not, is there an algorithm to determine how many are required? The problem was raised by Eggan (1963).
Read more about Star Height Problem: Families of Regular Languages With Unbounded Star Height, Computing The Star Height of Regular Languages
Famous quotes containing the words star, height and/or problem:
“Find out the peaceful hermitage,
The hairy gown and mossy cell,
Where I may sit and rightly spell
Of every star that heaven doth show,
And every herb that sips the dew;
Till old experience do attain
To something like prophetic strain.
These pleasures Melancholy give,
And I with thee will choose to live.”
—John Milton (1608–1674)
“Much more frequent in Hollywood than the emergence of Cinderella is her sudden vanishing. At our party, even in those glowing days, the clock was always striking twelve for someone at the height of greatness; and there was never a prince to fetch her back to the happy scene.”
—Ben Hecht (1893–1964)
“Any solution to a problem changes the problem.”
—R.W. (Richard William)