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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1968-2014
012319682014

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
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
Given a family of recognizable languages L1, . . . , Lm and recognizable languages K1 ⊆ K2, the relative inclusion star height… (More)
Is this relevant?
2008
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
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
Given a family of recognizable languages L1, . . . , Lm and recognizable languages K1 ⊆ K2, the relative inclusion star height… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2005
Review
1992
Review
1992
We prove some results related to the generalized star-height problem. In this problem, as opposed to the restricted star-height… (More)
  • figure 1
  • figure 2
  • figure 5
Is this relevant?
1984
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?