出典:Wiktionary
出典:Wikipedia
出典:『Wikipedia』 (2010/07/21 23:53 UTC 版)
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. The concept of star height was first defined and studied by Eggan (1963).