The star height problem in formal language theory is the question whether all regular languages can be expressed using regular expressions of limitedâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Mikolaj Bojanczyk
- 2015 30th Annual ACM/IEEE Symposium on Logic inâ€¦
- 2015

This paper proposes a new algorithm deciding the star height problem. As shown by Kirsten, the star height problem reduces to aâ€¦Â (More)

Is this relevant?

2011

2011

- Daniel Kirsten
- MFCS
- 2011

Given a family of recognizable languages L1, . . . , Lm and recognizable languages K1 âŠ† K2, the relative inclusion star heightâ€¦Â (More)

Is this relevant?

2008

2008

- Thomas Colcombet, Christof LÃ¶ding
- CSL
- 2008

In this paper we lift the result of Hashiguchi of decidability of the restricted star-height problem for words to the level ofâ€¦Â (More)

Is this relevant?

2007

2007

- Jonah Sherman
- 2007

The minimal number of nested Kleene stars required in a regular expression representing a language provides a simple complexityâ€¦Â (More)

Is this relevant?

2007

2007

- Daniel Kirsten
- 2007

Given a family of recognizable languages L1, . . . , Lm and recognizable languages K1 âŠ† K2, the relative inclusion star heightâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Review

1992

Review

1992

- Jean-Ã‰ric Pin, Howard Straubing, Denis ThÃ©rien
- Inf. Comput.
- 1992

We prove some results related to the generalized star-height problem. In this problem, as opposed to the restricted star-heightâ€¦Â (More)

Is this relevant?

1984

1984

- Achille J.-P. Braquelaire, Bruno Courcelle
- Automata on Infinite Words
- 1984

Regular trees can he detined by two types of rational exprwions. For these two types w;isolve the star-height problem, i.e., weâ€¦Â (More)

Is this relevant?

1976

1976

Â

Is this relevant?

1968