Regular Language
Regular Expression
Deterministic finite automata(DFA)
Non-deterministic finite automata(NFA)
Closure properties and Pumping Theorem
State Minimization (graduated course )
Question:
Give a DFA or NFA ⇒ Regular Expression (Example 2.3.2 P 81);
Give a Regular Expression ⇒ DFA or NFA (Theorem 2.3.1 P 75);
Show a given language be regular or non-regular?
(Yes, regular expression, DFA, NFA and closure property; No,
Pumping theorem or closure property)
() 4 / 21
Regular Language
Regular Expression
Deterministic finite automata(DFA)
Non-deterministic finite automata(NFA)
Closure properties and Pumping Theorem
State Minimization (graduated course )
Question:
Give a DFA or NFA ⇒ Regular Expression (Example 2.3.2 P 81);
Give a Regular Expression ⇒ DFA or NFA (Theorem 2.3.1 P 75);
Show a given language be regular or non-regular?
(Yes, regular expression, DFA, NFA and closure property; No,
Pumping theorem or closure property)
() 4 / 21
