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:
“Fear not: that ultimate Star is frail,
only a flake of snow,
whirled in His breath.”
—Hilda Doolittle (1886–1961)
“To achieve harmony in bad taste is the height of elegance.”
—Jean Genet (1910–1986)
“The perfect detective story cannot be written. The type of mind which can evolve the perfect problem is not the type of mind that can produce the artistic job of writing.”
—Raymond Chandler (1888–1959)