1 / 36

Erik Jonsson School of Engineering and Computer Science

Erik Jonsson School of Engineering and Computer Science. CS 5349.001 CS 4384 – HON 001. Automata Theory. http://www.utdallas.edu/~pervin. Tue sday: Sections 2.4 & 2.5 Look at Ullman’s Lectures 3 & 4. Thursday 0 9-04-13. FEARLESS Engineering. www.utdallas.edu/~pervin.

clinton-pierce
Download Presentation

Erik Jonsson School of Engineering and Computer Science

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

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

  3. Reducing the Number of States in a Finite Automata

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

  5. Example:

  6. Example:

  7. Note: All states reachable

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

  9. A non-regular language

  10. Martin, P. 76

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

  12. Martin P.97

  13. Martin P.99 (incorrect)

  14. Nondeterministic Finite Automata

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

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

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

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

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

  20. Linz, P.62

More Related