Ignore this box please.
More
Settings
Goodies
About
Help
Feedback
PRIVACY
DontTrack
DontBubble
Policy
COMMUNITY
Platform
Forum
Chat
Spread
Keyboard shortcuts
h, / search box
j, ↓ next result
k, ↑ prev result
l, o, Enter go
More...
Ctrl+Enter bg
', v new tab
d domain search
t Top
!, 1 !bang dropdown
esc out of bangs
s Did you mean
r related topics
m main results
More explanation...
Star height
In theoretical computer science, more precisely in the theory of formal languages, the star height is a measure for the structural complexity of regular expressions: The star height equals the maximum nesting depth of stars appearing in the regular expression.
More at Wikipedia
Star height problem
Generalized star height problem
Formal languages
This page requires Javascript.Get the non-JS version
here
.