Eggan's theorem

短语

释义与例句

name
  1. 1.

    A theorem stating that the star height of a regular language L equals the minimum cycle rank among all nondeterministic finite automata with ε-transitions accepting L.