Try this one: Prove that the language L = { 1k1 E N, k-2') is not...

Question

Question

Try this one:

Prove that the language L = { 1k1 E N, k-2) is not regular

engineering Computer-Science

Answer 1

Answer #1

we can be proved by using pumping lemma theorem

diven that numbes Some positive number quant by ustng pumping lemma where byln number.e CauX ence -Merefere *

Answer 2

Similar Homework Help Questions

Additional 9-14 Prove that the language {a"b" n, k ε N and n S k} is...

Additional 9-14 Prove that the language {a"b" n, k ε N and n S k} is not regular Hint: I go over this proof in the lecture. You can watch it again to make sure you follow it before doing it. 2 Additional 9-15 Prove that the language (a"b n, k E N and n Hint: a little different... 2 k Is not regular 3 Additional 9-16 Prove that the language (w w (a, b and w has an equal...
2. If L is a regular language, prove that the language 11 = { uv/ u...

2. If L is a regular language, prove that the language 11 = { uv/ u E 1 , |v|-2) is also regular. (Hint: Can you build an NFA of L1 using an NFA of a language L? Use N, the NFA of the language L)
Suppose that L is a regular language. Prove that the language p r e f i...

Suppose that L is a regular language. Prove that the language p r e f i x (L )={w | x, wx L } is regular. (For example, if L = {abc, def}, prefix(L) = {?, a, ab, abc, d, de, def}.)

3. [5 marks] Is the language L = {o € {a, b}* | |0la- l0b is divisible by 2",n 2 1} regular? Be sure to prove your...

3. [5 marks] Is the language L = {o € {a, b}* | |0la- l0b is divisible by 2",n 2 1} regular? Be sure to prove your answer 3. [5 marks] Is the language L = {o € {a, b}* | |0la- l0b is divisible by 2",n 2 1} regular? Be sure to prove your answer
Prove that the language L = {0^n1^m0^n | m, n greaterthanorequalto 0} is not regular.

Prove that the language L = {0^n1^m0^n | m, n greaterthanorequalto 0} is not regular.
Given the language L = {(01)n| n > 1000000}. State whether it is a regular language...

Given the language L = {(01)n| n > 1000000}. State whether it is a regular language or non-regular language. Prove your statement.

If L is a regular language, prove that the language {uv : u ∈L, v ∈LR}...

If L is a regular language, prove that the language {uv : u ∈L, v ∈LR} is also regular
5. Prove that the following languages are not regular: (a) L = {a"bak-k < n+1). (b)...

5. Prove that the following languages are not regular: (a) L = {a"bak-k < n+1). (b) L-(angla": kメn + 1). (c) L = {anglak : n = l or l k} . (d) L = {anb : n2 1} L = {w : na (w)关nb (w)). "(f) L = {ww : w E {a, b)'). (g) L = {w"www" : w E {a,b}*}
Prove that for each regular language L the following language is regular: shift(L) = {uv |...

Prove that for each regular language L the following language is regular: shift(L) = {uv | vu ∈ L}

Prove that, if L is a regular language over the alphabet Σ=(0,1), then L': { ax...

Prove that, if L is a regular language over the alphabet Σ=(0,1), then L': { ax | x E L } is also regular for any a E Σ