Erik Jonsson School of Engineering and Computer Science

Erik Jonsson School of Engineering and Computer Science CS 4384– 001 Automata Theory http://www.utdallas.edu/~pervin Thursday: Sections 2.7 & 2.8 Look at Ullman’s Lectures 5 & 6 Tuesday1-28-14 FEARLESS Engineering www.utdallas.edu/~pervin

Homework 3 SHOW YOUR WORK L(M) = Strings of even length ending with ‘a’. answer

Nondeterministic Finite Automata (NDA) M&S Section 2.4

Theorem: If L = L(N) for a NFA N, then L = L(D) for a DFA D. Linz P.61

Linz, P. 62

Then, using our methods, convert them to DFAs

Then, using our methods, convert it to a DFA

answer

Note that it is just as easy to build a DFA as a NFA in this case. answer

answer

Example 2.4.2 M&S P. 37 Sipser, Ex. 1.14 on P. 51 and Sudkamp, Exercise 6.18 P.165

Convert from NFA to DFA: Sudkamp Example 6.6.1 P. 152

Union • Concatenation • Kleene Star Regular Expressions

Martin, 3.7 P. 118

[(0+1)(0+1)(0+1)]* (1*01*0)*1* = 1*(01*01*)* 1* + 1*01* + 1*01*01* + 1*01*01*01* = Linz, P.78

Du method P. 18

Du, Example 1.24, P. 18 & Kozen, Example 9.1, P. 51

Ullman

Decision Problems Martin, P. 148 (1st Ed.)

Deterministic Finite Automata • Non-deterministic Finite Automata • Regular Expressions Regular Languages

PUMPING LEMMA M&S P. 68 Theorem 2.9.1

Erik Jonsson School of Engineering and Computer Science