Skip to main content

6.

20/02/23

... Given LΣL\subseteq\Sigma* TFAE (The following are equivalent)

  1. LL is the language of a DFA A -> L=LDFAAL=L^{DFA}A
  2. LL is the language of an NFA A -> L=LNFAAL=L^{NFA}A
  3. LL is the language of an RE:ERE:E -> L=LREEL=L^{RE}E

Given a RE:ERE:E we