Star Height Problem

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:

    To love someone is to isolate him from the world, wipe out every trace of him, dispossess him of his shadow, drag him into a murderous future. It is to circle around the other like a dead star and absorb him into a black light.
    Jean Baudrillard (b. 1929)

    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)

    The problem is that we attempt to solve the simplest questions cleverly, thereby rendering them unusually complex. One should seek the simple solution.
    Anton Pavlovich Chekhov (1860–1904)