Chapter 2: Finite automata

2.1 Deterministic Finite Accepters

• Definition: M=(Q, Σ, δ, q0, F)
• internal states
• input alphabet
• transition function δ: Q x Σ -> Q 
• initial state
• F in Q, final states
• Visualize and Represent finite automata: transition graphs
• Regular languages: L is called regular if and only if there exists some dfa accepter M such that L = L(M)

2.2 Nondeterministic Finite Accepter

• Definition: M=(Q, Σ, δ, q0, F)
• as for dfa but ransition function δ: Q x (Σ U {λ}) -> 2^Q

2.3 Equivalence of DFA and NFA

• DFA is an special NFA 
• NFA can convert to DFA
• link: http://www.cs.odu.edu/~toida/nerzic/390teched/regular/fa/nfa-2-dfa.html
• tools: JFLAP http://www.cs.duke.edu/csed/jflap/
• My lecture slides:http://www.sju.edu/~tezel/CSC_Courses/TheoryOfComputation/Fall_2010/Lectures/GroupLectures/Group2_2.3.pdf