Sep. 13, 2010 (Monday)
Chapter 1: Regular Languages
7
Regular Expressions
In the last class, we showed that the set of languages recognized by DFAs is the same as that recognized by NFAs (i.e. DFAs=NFAs). That is, if a language is recognized by an NFA, it
Sep. 10, 2010 (Friday)
Chapter 1: Regular Languages
6.4
Equivalence between NFA and DFA
Since a DFA is a special type of NFA, it seems that NFAs are more powerful than DFAs. But surprisingly, they have the same power in terms of the class of languages rec
Sep. 8, 2010 (Wednesday)
Chapter 1: Regular Languages
5
Minimum State Finite Automata
Theorem: For a regular language, there exists a unique (up to isomorphism) minimum state nite automaton recognizing it. Denition: A language is a regular language, if th
Sep. 3, 2010 (Friday)
Chapter 1: Regular Languages
Example 3 Design a nite automaton M 3 which recognizes the following language L3 = cfw_ x over cfw_0,1 | x does not end with 01, and contains substring 10 Solution One for Example 3 step 1: We remember th
Sep. 1, 2010 (Wednesday)
Chapter 1: Regular Languages
4
Design of Finite Automata
Three steps to design a nite automaton M to recognize a language L. step 1: determine the information to remember about the part of an input string which M has already read.
Sep. 15, 2010 (Wednesday)
Chapter 1: Regular Languages
7.5
Equivalent Regular Expressions
For any nite automaton, there is an equivalent regular expression describing the same language. We prove it by nding an equivalent regular expression for a nite auto
Sep. 17, 2010 (Friday)
Chapter 1: Regular Languages
7.6
Equivalent nite automaton M
For any regular expression R, there is an equivalent nite automaton M recognizing language L(R). We prove it by constructing an equivalent nite automaton for each of the s
Pumping Lemma
CSCE 428/828 Automata, Computation, and Formal Languages
Chapter 1: Regular Languages 8. Pumping Lemma
September 20, 2010
Review: A language is regular, if there is a DFA recognizing it, or an NFA recognizing it, or a RE describing it. The p