Unformatted text preview: the numbers oF a’s and b’s are equal; and the numbers oF c’s and d’s are equal. (b) The set WEIRD oF strings oF 0’s and 1’s which have: an even number oF 0’s, a number oF 1’s that is not a multiple oF 5, and end with an odd number oF 0’s (atleast 3). So, For example 0110110000 is not in the language, but 0011011000 is; 0000, 00100 and 0101010101000 are not in the language but 0100000 is. (c) Let L be regular. ClassiFy the language VERYDI±±ERENT(L) = { z : ∀ x, u, v ∈ Σ * ( xuv = z ) ⇒ ( u n∈ L ) } I.e, VERYDI±±ERENT(L) is the set oF all strings oF which no substring belongs in L . (d) The set BALANCED = { a k b l c m d n : n + k = m + l } . 1...
View
Full
Document
This note was uploaded on 01/15/2012 for the course COT 6315 taught by Professor Staff during the Spring '08 term at University of Florida.
 Spring '08
 Staff

Click to edit the document details