In formal language theory, the star height problem is the question whether all regular languages can be expressed using regular expressionss 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 first introduced by Eggan in 1963.

Families of regular languages with unbounded star height

The first question was answered in the negative when in 1963, Eggan gave examples of regular languages of star height. The first few languages found by Eggan are described in the following, by means of giving a regular expression for each language:

.

However, Eggan's examples use a large alphabet. He thus asked whether we can also find examples over binary alphabets. This was proved to be true shortly afterwards by Dejean and Schützenberger in 1966. Their examples can be described by an inductively defined as follows:

Computing the star height of regular languages

Eggan's second question, i.e., whether there exists an algorithm to determine the star height of a language, turned out to be much more difficult. The pure-group languages were the first interesting family of regular languages for which the star height problem was proved to be decidable. The general problem remained open until it was settled by Hashiguchi in 1988, who published an algorithm to determine the star height of any regular language. The algorithm, however, wasn't practical, being of non-elementary complexity:

alone has 10 billion zeros when written down in decimal notation, far larger than the number of atoms in the observable universe.

A much more efficient algorithm than Hashiguchi's procedure was devised by Kirsten in 2005. This algorithm runs, for a given nondeterministic finite automaton as input, within double-exponential space. Yet the resource requirements of this algorithm still greatly exceed the margins of what is considered practically feasible.

This algorithm has been optimized and generalized to trees by Colcombet and Löding in 2008, as part of the theory of regular cost functions. It has been implemented in 2017 in the tool suite Stamina.

See also

• Generalized star height problem

• Kleene's algorithm computes a regular expression (usually of non-minimal star height) for a language given by a deterministic finite automaton

Notes

References

Further reading