1 / 31

Erik Jonsson School of Engineering and Computer Science

Erik Jonsson School of Engineering and Computer Science. CS5349-001 ( CS 4384 – HON 001). Automata Theory. http://www.utdallas.edu/~pervin. Tu esday : Start Chapter 2 Look at Ullman’s Lectures 2 & 3. Thurs day 8-28-14. FEARLESS Engineering. www.utdallas.edu/~pervin.

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 CS5349-001 (CS 4384– HON001) Automata Theory http://www.utdallas.edu/~pervin Tuesday: Start Chapter 2 Look at Ullman’s Lectures 2 & 3 Thursday 8-28-14 FEARLESS Engineering www.utdallas.edu/~pervin

  2. SYLLABUS SYLLABUS

  3. CS 4384 26 August 2013 HOMEWORK 0 Due 28 August 2013 Keep copies of your homework; they probably will not be returned but instead submitted to ABET/SACS for accreditation

  4. A palindrome can be defined as a string that reads the same backward and forward, or by the following definition: • 1) e is a palindrome. • 2) If a is any symbol, then the string a is a palindrome. • 3) If a is a symbol and x is a palindrome, then axa is a palindrome. • 4) Nothing else is a palindrome unless it follows from 1) through 3). Palindrome Note: We will prove later that no FA accepts Palindrome.

  5. CS 5349/4384 26/28 August 2014 HOMEWORK 1Due: 2 September 2014 Written carefully on 8.5x11 white paper as for your boss!

  6. A = {w : w is a binary string containing an odd number of 1s} • B = {w: w is a binary string containing 101 as a substring} • C = {we {0,1}* : w has a 1 in the third position from the right} M&S Examples 2.2.1 p.26; 2.2.2 p.28; 2.2.3 p.29

  7. A = {w : w is a binary string containing an odd number of 1s} What’s wrong with: ….

  8. B = {w: w is a binary string containing 101 as a substring}

  9. C = {we {0,1}* : w has a 1 in the third position from the right}Just remember the last three symbols

  10. C = {we {0,1}* : w has a 1 in the third position from the right}Just remember the last three symbols

  11. Language • A language is a set of strings. For example, {0, 1}, {all English words}, {0, 0, 0, ...} are all languages. • The following are operations on sets and hence also on languages. Union: A U B Intersection: A ∩ B Difference: A \ B (A - B when B A) Complement: A = Σ* - A where Σ* is the set of all strings on alphabet Σ. 0 1 2 _ Du

  12. Concatenation: • For example, {0, 1}{1, 2} = {01, 02, 11, 12}. • Especially, we denote A = A, A = AA, ..., and define A = {ε}. 2 1 0 Concatenation of Languages Du

  13. Kleene Star

  14. The set of regular languages is closed under the union operation Theorem 2.3.1 M&S p. 32

  15. Proof:

  16. The set of regular languages is closed under the intersection operation Theorem 2.3.1 Addendum M&S p. 32

  17. Proof:

  18. The set of regular languages is closed under the complement operation Theorem 2.3.1 Addendum M&S p. 32

  19. Proof:

  20. The set of regular languages is closed under the Kleene star and concatenation operations To be proved later: M&S p. 32

  21. CS 5349/4384 28 August 2014 HOMEWORK 2 Due 2 September 2014 Keep copies of your homework; they probably will not be returned but instead submitted to ABET/SACS for accreditation

  22. Du p.15

  23. Binary expansion of positive integers congruent to zero mod 5

  24. Binary expansion of positive integers congruent to zero mod 5

  25. Binary expansion of non-negative integers congruent to 0 mod 5

  26. What is L(M)?

  27. Recursive Definition

  28. Another Recursive Definition

  29. Problem Recursive Definition

More Related