{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Homework_5 - b The set of strings of balanced parentheses...

Info icon This preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Theory of Computing Homework 5 CS 3810, Fall 2009 Due Friday, October 2 General guidelines: You may work with other people, as long as you write up your solution in your own words and understand everything you turn in. Make sure to justify your answers—they should be clear and concise, with no irrelevant information. Each problem should be submitted on a separate piece of paper. Please put your netid on your homework! 1. 4.2.6 by machine construction Show that the regular languages are closed under the following operations. a) min(L)={w|w is in L, but no proper prefix of w is in L}. b) max(L)={w|w is in L and for no x other than ε is wx in L}. c) init(L)={w|for some x, wx is in L}. Hint: It is easiest to start with a DFA for L and perform a construction to get the desired language. 2. 4.4.1 a) Draw the table of distinguishabilities for the automaton below. b) Construct the minimum-state equivalent DFA. 0 1 * A B A B A C C D B D D A E D F F G E G F G H G D 3. 4.1.1 b and d Prove that the following are not regular languages.
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: b) The set of strings of balanced parentheses. These are the strings of characters “(“ and “)” that can appear in a well-formed arithmetic expression. d) { } 0 1 2 | and are arbitrary integers n m n n m . CONTINUES ON NEXT PAGE Theory of Computing Homework 5 CS 3810, Fall 2009 Due Friday, October 2 4. 4.1.2 c, e, and h Prove that the following sets are not regular languages. c) { } 0 | is a power of 2 n n e) The set of strings of 0’s and 1’s that are of the form ww, that is, some string repeating. h) The set of strings of the form 1 n w , where w is a string of 0’s and 1’s of length n. 5. 4.2.13 Start with the fact that the language { } 0 1 0 1 | n n n n L n = ≥ is not a regular set. Prove the following languages not to be regular by transforming them, using opertions known to preserve regularity, to 0 1 n n L : a) { } 01 | i j i j ≠ b) { } 0 1 2 | n m n m n m-≥ ≥ ....
View Full Document

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern