This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: b) The set of strings of balanced parentheses. These are the strings of characters “(“ and “)” that can appear in a wellformed 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
 Fall '07
 HOPCROFT
 Formal language, Regular expression, Theory of Computing, Computing CS, 0 1 2 nm, EDF FGE GFG

Click to edit the document details