TOPICS
Search

Star Height


The star height of a regular language is the minimum, over its ordinary regular expressions, of the maximum nesting depth of Kleene stars. Ordinary expressions use union, concatenation, and Kleene star, without complement. An expression with no star has height zero; a star increases the height of its argument by one.

Generalized star height permits complement as well, so it can be smaller than ordinary star height. A bound for generalized star height does not by itself bound ordinary star height.


See also

Generalized Star Height, Kleene Star, Regular Expression, Regular Language

Explore with Wolfram|Alpha

References

Kirsten, D. "Distance Desert Automata and the Star Height Problem." RAIRO Inform. Théor. Appl. 39, 455-509, 2005. https://doi.org/10.1051/ita:2005027.Pin, J.-É.; Straubing, H.; and Thérien, D. "Some Results on the Generalized Star-Height Problem." Inform. Comput. 101, 219-250, 1992. https://doi.org/10.1016/0890-5401(92)90063-L.

Cite this as:

Weisstein, Eric W. "Star Height." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/StarHeight.html

Subject classifications