Unformatted text preview: L = { i 1 j  i,j ≥ 0 and i 6 = j } . b. The language L 10 for the lexicographically ﬁrst 10 strings of the language L . c. The language M = { xy ∈ { , 1 } *  the number of in x is the same as the number of in y } . Problem 4.3. (10 points) Give a contextfree grammar for the language { i 1 j 2 k  i,j,k ≥ 0 and either i = j or i = k } . Is this language regular (justify)?...
View
Full Document
 Winter '08
 Rupak
 Formal language, 2k, 1J, Contextfree grammar, Formal Languages and Automata Theory, context free languages

Click to edit the document details