Erik Jonsson School of Engineering and Computer Science

1. Erik Jonsson School of Engineering and Computer Science CS 4384– 001 Automata Theory http://www.utdallas.edu/~pervin Tuesday: Sections 2.4 & 2.5 Look at Ullman’s Lectures 3 & 4 Thursday 1-23-14 FEARLESS Engineering www.utdallas.edu/~pervin

3. Reducing the Number of States in a Finite Automata

4. Note: This divides the states into equivalence classes.

12. answer

13. L(M) = the set of positive even length strings ending in the character a. answer

14. A non-regular language

15. Nondeterministic Finite Automata (NDA) M&S Section 2.4

16. Martin P.97

17. Martin P.99 (incorrect)

18. Nondeterministic Finite Automata

22. Find an NFA that accepts the set of binary strings beginning with 010 or ending with 110.

23. Comment: For every NFA there is an equivalent NFA that has only one initial state and only one accepting (final) state.

26. Construct a NFA that accepts the language: The set of binary strings that contain at least three occurrences of the substring 010.

27. Construct a NFA that accepts the language: (b) The set of binary strings that contain both substrings 010 and 101.

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

30. Linz, P.62

31. Then, using our methods, convert them to DFAs

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

33. Example 2.4.3 M&S P. 38 Sipser, Ex. 1.15 on P. 52

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

39. Union • Concatenation • Kleene Star Regular Expressions

40. Ullman Lecture 5

41. Ullman Lecure 5

46. Martin, 3.7 P. 118

47. Linz, P.78