Eggan's theorem
Eggan's theorem proper noun: 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.
Proper noun
Eggan's theorem
- 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.
Questions about Eggan's theorem
- What does Eggan's theorem mean?
- Eggan's theorem means 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.
- What part of speech is Eggan's theorem?
- Eggan's theorem is a proper noun.
Words near Eggan's theorem in the dictionary
Source and license
Adapted from Wiktionary: Eggan's theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Eggan's theorem.” Word.ws, https://word.ws/eggan%27s_theorem. Based on Wiktionary, CC BY-SA 4.0.
