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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper noun
  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.
Cite this entry
APA

Eggan's theorem. (n.d.). In WatkinsX Dictionary. Retrieved November 5, 2026, from https://dictionary.watkinsx.com/word/Eggan's%20theorem

MLA

“Eggan's theorem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Eggan's%20theorem. Accessed November 5, 2026.

Chicago

WatkinsX Dictionary, s.v. “Eggan's theorem,” accessed November 5, 2026, https://dictionary.watkinsx.com/word/Eggan's%20theorem.

Source: Eggan's theorem on Wiktionary, CC BY-SA 4.0.