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:
“My advice to those who think they have to take off their clothes to be a star is, once you’re boned, what’s left to create the illusion? Let ‘em wonder. I never believed in givin’ them too much of me.”
—Mae West (1892–1980)
“To say more than human things with human voice,
That cannot be; to say human things with more
Than human voice, that, also, cannot be;
To speak humanly from the height or from the depth
Of human things, that is acutest speech.”
—Wallace Stevens (1879–1955)
“A serious problem in America is the gap between academe and the mass media, which is our culture. Professors of humanities, with all their leftist fantasies, have little direct knowledge of American life and no impact whatever on public policy.”
—Camille Paglia (b. 1947)