t12sample

# t12sample - the numbers oF a’s and b’s are equal and...

This preview shows page 1. Sign up to view the full content.

COT 6315) Sample Test 2(2 hrs–closed book) Note this is only a rough guide. The structure will be similar. I.e, classif- cation questions. Individual items need not Follow pattern oF those given below. You need to work on the HW and other exercises in book – the items can Follow the spirit oF any oF them. –Please write your name and code legibly on top oF your answer sheet. Answer all questions. Please budget your time so that you spend no more than an average oF 17 min on each (sub)question. 1. ClassiFy the Following languages are regular, contextFree but not regular; or not context Free. Give a Full justifcation oF your classifcation. (a) The set QUITEEQUAL oF strings in a 4 letter alphabet, in which
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online