Presentation is loading. Please wait.

Presentation is loading. Please wait.

Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin CS 5349.001 CS 4384 – HON001 Automata Theory

Similar presentations


Presentation on theme: "Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin CS 5349.001 CS 4384 – HON001 Automata Theory"— Presentation transcript:

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

2 SYLLABUS SyllabusOfficialS2013.docx 2 Final Exam: Thursday, 18 December :00am – 10:45am in our regular classroom

3 Reducing the Number of States in a Finite Automata 3

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

5 5

6 6

7 7

8 8

9 9 Example:

10 10 Example:

11 11

12 12

13 13

14 14 Note: All states reachable

15 15

16 16answer L(M) = Strings of even length ending with ‘a’.

17 17

18 A non-regular language 18

19 19Martin, P. 76

20 Nondeterministic Finite Automata (NDA) M&S Section

21 Martin P.9721

22 Martin P.99 (incorrect)22

23 Nondeterministic Finite Automata 23

24 24

25 25

26 26

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

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

29 29

30 30

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

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

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

34 34

35 35Linz, P.62

36 36


Download ppt "Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin CS 5349.001 CS 4384 – HON001 Automata Theory"

Similar presentations


Ads by Google