Q2➡| NET December 2022 In pumping lemma for regular languages, to say a language is satisfying pumping lemma, what is the minimum length of ‘y’ if you consider the string as ‘xyz’.
i ➥ n
ii ➥ 2
iii ➥ 1
iv ➥ 0
Best Explanation: Answer: (iii) Explanation: Upload Soon
Q3➡| NET December 2022 In the ɛ-NFA , M = ({q0, q1, q2, q3}, {a}, δ , q0, {q3} ) where ‘δ ’ is given in the transition table below, what is the minimum length of string to reach to the final state?
i ➥ 0
ii ➥ 1
iii ➥ 2
iv ➥ 3
Best Explanation: Answer: (ii) Explanation: Upload Soon
Q4➡| NET December 2022 The Transition function ‘δ’ in mu Which of the following is /are correct about the regular expression? aa*bb*cc*dd* (A) The language for the given expression L = { a^{n}b^{n}c^{m}d^{m} | n≥1, m≥1 } ∪ { a^{n}b^{m}c^{m}d^{n} | n≥1, m≥1 } (B) The context free language for the given expression is S→AB | C A→ aAb | ab B→ cBd | cd C→aCd | aDd D→bDc | BC (C) The language generated by this expression is equal number of a’s, followed by equal number of b’s , followed by equal number of c’s and followed by equal number of d’s. Choose the correct answer from the options given below:
i ➥ Only A is correct
ii ➥ Only B is Correct
iii ➥ Both A and B are correct
iv ➥ All the three A, B and C are correct
Best Explanation: Answer: (iii) Explanation: Upload Soon
Q5➡| NET December 2022 which of the following are correct on regular expression? (A) φ + L = L + φ = L (B) ɛ L = L ɛ = L (C) φ L = L φ = φ (D) φ L = L φ = L Choose the correct answer from the options given below:
i ➥ A, B and D only
ii ➥ A, B and C only
iii ➥ B and D only
iv ➥ A and D only
Best Explanation: Answer: (ii) Explanation: Upload Soon
Q13➡| NET june 2022 Consider the Properties of recursively enumerable sets: (A) Finiteness (B) Context freedom (C) Emptiness Which of the following is true?
i ➥ Only (A) and (B) are not decidable
ii ➥ Only (B) and (C) are not decidable
iii ➥ Only (C) and (A) are not Decidable
iv ➥ All (A), (B) and (C) are not decidable
Best Explanation: Answer: (iv) Explanation: Upload Soon
Q21➡| NET June 2022 Consider the following statements about Context Free Language ( CFL) : Statement (I) : CFL is closed under homomorphism Statement (II) : CFL is closed under complement Which of the following is correct?
i ➥ Statement (I) is true and statement (II) is false
ii ➥ Statement (II) is true and statement (I) is false
iii ➥ Both statement (I) and statement (II) are true
iv ➥ Both statement (I) and statement (II) are false
Best Explanation: Answer: (i) Explanation: Upload Soon
Q22➡| NET June 2021 Which of the following languages are not regular? A. L={ (01)^{n}0^{k} | n > k, k>=0 } B. L={ c^{n}b^{k}a^{n+k} | n >= 0, k>=0 } C. L={ 0^{n}1^{k} | n≠k } Choose the correct answer from the options given below:
i ➥A and C only
ii ➥ A and B only
iii ➥A, B and C
iv ➥B and C only
Show Answer With Best Explanation
Answer: III Explanation: Regular language does not have any memory to compare. A. L={ (01)^{n}0^{k} | n > k, k>=0 } Here, occurance of n is greater than occurance of k, for that we need to compare value of n with k, and regular language does not have power to compare. so,it is not regular language. It is Context Free Language.
B. L={ c^{n}b^{k}a^{n+k} | n >= 0, k>=0 } Here, occurance of c is less than or equal to ocuurance of a and Finite Automata cannot do this comparison. So, it is not regular language . It is Context Free Language.
C. L={ 0^{n}1^{k} | n≠k } Here, occurance of n is not equal to occurance of k, and this type of comparison cannot be done by Finite Automata.So, it is also not regular language . It is Context Free Language.
Q23➡| NET June 2021 What language is accepted by the pushdown automaton M=({q_{0}, q_{1}, q_{2}}, {a, b}, {a, b, z}, δ, q_{0}, z, {q_{2}}) with δ(q_{0}, a, a) ={ (q_{0}, aa) }; δ(q_{0}, b, a) ={(q_{0}, ba)} δ(q_{0}, a, b) ={ (q_{0}, ab) }; δ(q_{0}, b, b) ={ (q_{0}, bb) } δ(q_{0}, a, z) ={ (q_{0}, az) }; δ(q_{0}, b, z) ={ (q_{0}, bz) } δ(q_{0}, λ, b) ={ (q_{1}, b) }; δ(q_{0}, λ, a) ={ (q_{1}, a) } δ(q_{1}, a, a) ={ (q_{1}, λ) }; δ(q_{1}, b, b) ={ (q_{1}, λ) } δ(q_{1}, λ, z) ={ (q_{2}, z) }?
i ➥L = { w | n_{a}(w) <= n_{b}(w), w Є {a, b}^{+}}}
ii ➥ L = { w | n_{a}(w) = n_{b}(w), w Є {a, b}^{+}}}
iii ➥L = { w | n_{b}(w) <= n_{a}(w), w Є {a, b}^{+}}}
iv ➥L= {ww^{R }| w Є {a, b}^{+}}
Show Answer With Best Explanation
Answer: IV Explanation: Given, pushdown automata M=({q_{0}, q_{1}, q_{2}}, {a, b}, {a, b, z}, δ, q_{0}, z, {q_{2}}) where, {q_{0}, q_{1}, q_{2}} = Finite state of states {a, b} = Input alphabet {a, b, z} = Stack alphabet δ = Transition Function q_{0} = Initial state z = Bottom of the stack {q_{2}} = Final state Let’s Draw pushdown automata for a given Transition function:
First, keep pushing any number of a’s and b’s in the stack , and then pop one a from stack on seeing input alphabet a and pop oneb from stack on seeing input alpbabet b. Keep popping untill we reach end of string λ. when we reach end of string λ and Top of Stack is z, then go to final state. Let’s take one string and analyze them suppose string
Language generated by above push down automata (L)= {ww^{R }| w Є {a, b}^{+}} So, Option(IV) is correct.
Q24➡| NET June 2021 L_{1} = { 0^{n}1^{n}0^{m} | n>=1, m>=1 } L_{2}= { 0^{n}1^{m}0^{m} | n>=1, m>=1 } L_{3} = { 0^{n}1^{n}0^{n} | n>=1} Which of the following are correct statements? A. L_{3} =L_{1} ∩ L_{2} B. L_{1} and L_{2} are context free languages but L_{3} is not a context free language C. L_{1} and L_{2} are not context free languages but L_{3} is a context free language D. L_{1} is a subset of L_{3} Choose the correct answer from the options given below:
i ➥A and C only
ii ➥ A and D only
iii ➥A only
iv ➥ A and B only
Show Answer With Best Explanation
Answer: IV Explanation: Statement A: L_{3} =L_{1} ∩ L_{2} L_{1} = { 0^{n}1^{n}0^{m} | n>=1, m>=1 } = {010, 0100, 00110, 001100……………………} L_{2}= { 0^{n}1^{m}0^{m} | n>=1, m>=1 } = {010, 0010, 01100, 001100…………………. } L_{3} =L_{1} ∩ L_{2} = {010, 001100, 000111000…………………….} = {0^{n}1^{n}0^{n} | n>=1} Statement A is correct. Statement B:L_{1} and L_{2} are context free languages but L_{3} is not a context free language L_{1} = { 0^{n}1^{n}0^{m} | n>=1, m>=1 } let’s draw push down automata for above language: =1, m>=1 }”> Language L_{2} is Context Free Language.
L_{3} = { 0^{n}1^{n}0^{n} | n>=1} Here, n times 0 followed by n times 1 followed by n times 0, this kind of comparison cannot be done by Push Down Automata. So, it is not Context Free Language. It is Context Sensitive Language. Statement B is correct.
Statement C: L_{1} and L_{2} are not context free languages but L_{3} is a context free language As statement B is correct, Statement C is obviously incorrect.
Statement D: L_{1} is a subset of L_{3} L_{1} = { 0^{n}1^{n}0^{m} | n>=1, m>=1 } = {010, 0100, 00110, 001100……………………} L_{3} ={ 0^{n}1^{n}0^{n} | n>=1} = {010, 001100, 000111000…………………….} As see, L_{1} is superset L_{3} Statement D is incorrect. So, Option(IV) is correct.
Q28➡| NET June 2021 Given below are two statements Statement I: The family of context free languages is closed under homomorphism Statement II: The family of context free languages is closed under reversal. In light of the above statements, choose the correct answer from the options given below
i ➥Both Statement I and Statement II are false
ii ➥ Both Statement I and Statement II are true
iii ➥Statement I is false but Statement II is true
Q31➡| NET November 2020 Consider the following languages:
i ➥ L_{1} and L_{2 } only
ii ➥ L_{1} and L_{3} only
iii ➥L_{1} only
iv ➥ None of these
Show Answer With Best Explanation
Answer: IV Explanation: Since, Regular Language doesn’t have memory .So, it doesn’t have capacity to hold anything.
In L1, in order to calculate a^{źZ} we have to first calculate z^{z } & store the value in memory then need to calculate power of a. but we already known that Regular Language doesn’t have capacity to hold anything. So, L1 is not regular language.
In L2, again we have to calculate zź , then store it & then need to find power of a. So, L2 is also not regular language.
In L3, we have to compare first ω with second ω. But, Regular Language doesn’t have capacity to compare two string. So L3 is also not regular language.
Theory of Computation Subject Wise UGC NET Question Analysis
Q32➡|NET November 2020 Consider the following regular expressions: a) r=a(b+a)* b) s=a(a+b)* c) t=aa*b Choose the correct answer from the options given below based on the relation between the languages generated by the regular expressions above:
i ➥ L(r)⊆L(s)⊆L(t)
ii ➥ L(r)⊇L(s)⊇L(t)
iii ➥ L(r)⊇L(t)⊇L(s)
iv ➥ L(s)⊇L(t)⊇L(r)
Show Answer With Best Explanation
Answer: II Explanation: R = {a, ab, aa, aba, aaa, aab, abb…….} S = {a, aa, ab, aab, aaa, abb, aba…….} T = {ab, aab, aaab, …………………………} If you notice then r ⊇ s ⊇ t
Q33➡|NET November 2020 Let L1 and L2 be languages over Σ =(a,b) represented by the regular expressions (a* + b)* and (a+b)* respectively. Which of the following is true with respect to the two languages?
Q34➡| NET November 2020 Which of the following grammars is (are) ambiguous? (A) s → ss | asb | bsa | λ (B) s → asbs | bsas | λ (C) s → aAB A → bBb B → A | λ where λ denotes empty string Choose the correct answer from the options given below:
Q37➡|NET November 2020 Given below are two statements: Statement I: The problem “Is L1 ∧ L2=Ø?” is undecidable for context sensitive languages L1 and L2. Statement II: The problem “Is W ∈ L?”is decidable for context sensitive language L, (where W is a string). In the light of the above statements, choose the correct answer from the options given below:
i ➥ Both Statement I and Statement II are true
ii ➥ Both Statement I and Statement II are false
iii ➥Statement I is correct but Statement II is false
iv ➥Statement I is incorrect but Statement II is true
Q38➡|NET November 2020 Let G1 and G2 be arbitrary context free languages and R an arbitrary regular language. Consider the following problems: A) Is L(G1)=L(G2)? B) Is L(G2)≤L(G1)? C) Is L(G1)=R? Which of the problems are undecidable?
Choose the correct answer from the options given below:
Theory of Computation Subject Wise UGC NET Question Analysis
Q39➡|NET December 2019 Let G = (V, T, S, P) be any context-free grammar without any λ-productions or unit productions. Let K be the maximum number of symbols on the right of any production P. The maximum number of production rules for any equivalent grammar in Chomsky normal form is given by:
Q41➡| NET December 2019 Consider Σ = {w, x} and T = {x, y, z}. Define homomorphism h by : h(x) = xzy h(w) = zxyy If L is the regular language denoted by r=(w+x*)(ww)*. then the regular language h(L) is given by
Q42➡|NET December 2019 Consider the following statements: S1: These exists no algorithm for deciding if any two Turning machine M1 and M2 accept the same language. S2: Let M1 and M2 be arbitrary Turing machines. The problem to determine L(M1)⊆ L(M2)is undecidable.
Q44➡|NET December 2019 Let A = (001, 0011, 11, 101} and B = (01, 111, 111, 010}. Similarly, let C = {00, 001, 1000} and D = {0, 11,011}. Which of the following pairs have a post-correspondence solution?
Q47➡| NET June 2019 Which of the following problems is/are decidable problem(s) (recursively enumerable) on a Turing machine M? (a) G is a CFG with L(G)=∅ (b) There exist two TMs M1 and M2 such that L(M) ⊆{L(M1)UL(M2)}= language of all TMs (c) M is a TM that accepts w using a most 2|w| cells of tape
Q48➡| NET June 2019 For a statement A language L ⊆ Σ* is recursive if there exists some Turing machine M Which of the following conditions is satisfied for any string w?
i ➥ If w ε L, then m accepts w and M will not halt
ii ➥ If w ∉ L, then M accepts w and M will halt by reaching at final state
iii ➥If w ∉ L, then M halts without reaching to acceptable state
iv ➥If w ε L, then M halts without reaching to an acceptable state
Q49➡| NET June 2019 Match List-I with List-II: Where L1 : Regular language L2 : Context-free language L3 : Recursive language L4 : Recursively enumerable language
Q50➡| NET June 2019 How can the decision algorithm be constructed for deciding whether context-free language L is finite? (a) By constructing redundant CFG in CNF generating language L (b) By constructing non-redundant CFG G in CNF generating language L (c) By constructing non-redundant CFG in CNF generating language L-{∧} (∧ stands for null) Which of the following is correct?
Q51➡| NET June 2019 How many states are there in a minimum state automata equivalent to regular expression given below? Regular expression is a*b(a+b).
Q52➡| NET June 2019 Consider the following grammar: S→ XY X→ YaY | a and y → bbX Which of the following statements is/are true about the above grammar? (a) Strings produced by the grammar can have consecutive three a’s (b) Every string produced by the grammar have alternate a and b (c) Every string produced by the grammar have at least two a’s (d) Every string produced by the grammar have b’s in multiple of 2.
Q53➡| NET December 2018 Consider the following two languages: L 1 = {X| for some y with | Y| = 2 |X| , XY∈ L and L is regular language} L 2 = { X | for some y such that |X| = |Y|, XY∈ L and L is regular language} Which one of the following is correct?
Q54➡| NET December 2018 Consider the following language: L 1 = { a^{n+m} b^{n} a^{m} | n, m ≥ 0 } L 2 = { a^{n+m} b^{n+m} a^{n+m} |n, m ≥ 0 } Which one of the following is correct?
i ➥ Only L 1 is Context Free Language
ii ➥ Both L 1 and L 2 are not Context Free Language
Q55➡| NET December 2018 Consider the following problems: (i) Whether a finite automaton halts on all inputs? (ii) Whether a given Context Free Language is regular? (iii) Whether a Turing Machine computes the product of two numbers? Which one of the following is correct?
Q56➡|NET December 2018 Consider the language L given by L = { 2^{nk} | k > 0 , and n is non−negative integer number } The minimum number of states of finite automaton which accept the language L is
Q58➡| NET December 2018 Consider R to be any regular language and L_{1}, L_{2} be any two context-free languages Which one of the following is correct ? A. (L_{1} ⋃ L_{2} ) − R is context free B. L’_{1} is context free C. L_{1} − R is context free D. L_{1} ⋂ L_{2} is context free
Q73➡| NET November 2017 Paper III Consider the following languages: L1 = {a^{m} b^{n} │ m ≠ n} L2 = {a^{m} b^{n} │ m = 2n+1} L3 = {a^{m} b^{n} │ m ≠ 2n} Which one of the following statement is correct ?
Q74➡| NET January 2017 Paper II Which of the following strings would match the regular expression : p+ [3 – 5]∗ [xyz]? I. p443y II. p6y III. 3xyz IV. p35z V. p353535x VI. ppp5
Q75➡| NET January 2017 Paper III Which of the following are not regular? (A) Strings of even number of a’s. (B) Strings of a’s, whose length is a prime number. (C) Set of all palindromes made up of a’s and b’s. (D) Strings of a’s whose length is a perfect square.
Q77➡| NET January 2017 Paper III Given the following statements : (A) A class of languages that is closed under union and complementation has to be closed under intersection. (B) A class of languages that is closed under union and intersection has to be closed under complementation. Which of the following options is correct?
Q78➡| NET January 2017 Paper III Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A → v, with |v| = K > 1. The derivation tree for any W ∈ L(G) has a height h such that
Q79➡| NET January 2017 Paper III Given the following two languages: L1= {an bn | n ≥ 0, n ≠ 100} L2 = {w ∈ {a, b, c}*| na(w) = nb(w) = nc(w)} Which of the following options is correct ?
i ➥ Both L1 and L2 are not context free language
ii ➥ Both L1 and L2 are context free language.
iii ➥ L1 is context free language, L2 is not context free language.
iv ➥ L1 is not context free language, L2 is context free language.
Q80➡| NET January 2017 Paper III Given the following two statements : A. L = {w|n_{a}(w) = n_{b}(w)} is deterministic context free language, but not linear. B. L = {a^{n} b^{n}} ∪ {a^{n} b^{2n}} is linear, but not deterministic context free language. Which of the following options is correct ?
Q83➡| NET June 2016 Paper II The number of strings of length 4 that are generated by the regular expression (0|∈)1^{+} 2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is :
Q85➡| NET June 2016 Paper III Consider the following identities for regular expressions: (a) (r + s)* = (s + r)* (b) (r*)^{*} = r* (c) (r* s*)^{*} = (r + s)* Which of the above identities are true?
Q86➡|NET June 2016 Paper III Given the following two languages : L_{1} = {uww^{R}ν | u, v, w ∈ {a, b}^{+}} L_{2} = {uww^{R}ν | u, ν, w ∈ {a, b}^{+}, |u| > |ν|} Which of the following is correct ?
i ➥ L_{1} is regular language and L_{2} is not regular language.
ii ➥ L_{1} is not regular language and L_{2} is regular language.
iii ➥ Both L_{1} and L_{2} are regular languages.
iv ➥ Both L_{1} and L_{2} are not regular languages
Q87➡| NET June 2016 Paper III Given a Turing Machine M = ({q_{0} , q_{1} }, {0, 1}, {0, 1, B}, δ, B, {q_{1} }) Where δ is a transition function defined as δ(q_{0} , 0) = (q_{0} , 0, R) δ(q_{0} , B) = (q_{1} , B, R) The language L(M) accepted by Turing machine is given as :
Q88➡| NET June 2016 Paper III Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A → ν, with |ν| = k > 1. The derivation tree for any string W ∈ L (G) has a height such that
Q91➡| NET August 2016 Paper III Consider the following two languages : L^{1} = {0^{i}1^{j}| gcd (i, j) = 1} L_{2} is any subset of 0*. Which of the following is correct ?
i ➥ L_{1} is regular and L_{2}* is not regular
ii ➥ L_{1} is not regular and L_{2}* is regular
iii ➥ Both L_{1} and L_{2}* are regular languages
iv ➥ Both L_{1} and L_{2}* are not regular languages
Q92➡| NET August 2016 Paper III Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation R_{M} defined by M. As all states are reachable from the start state, R_{M} has____equivalence classes.
Q94➡| NET August 2016 Paper III Given a Turing Machine M = ({q_{0}, q_{1},^{ }q_{2}, q_{3}}, {a, b}, {a, b, B}, δ, B, {q_{3}}) Where δ is a transition function defined as δ( q_{0} , a) = ( q_{1} , a, R) δ( q_{1} , b) = ( q_{2} , b, R) δ( q_{2} , a) = ( q_{2} , a, R) δ( q_{3} , b) = ( q_{3}, b, R) The language L(M) accepted by the Turing Machine is given as:
Q97➡| NET December 2015 Paper III The language of all non-null strings of a’s can be defined by a context free grammar as follows: S → aS|Sa|a The word a^{3} can be generated by _________different trees.
Q98➡| NET December 2015 Paper III The context free grammar given by S → XYX X → aX|bX|λ Y → bbb generates the language which is defined by regular expression:
Q99➡| NET December 2015 Paper III There are exactly __ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state.
Q100➡| NET December 2015 Paper III Given the following two languages: L_{1} = {a^{n} b a^{n} |n > 0} L_{2} = {a^{n} b a^{n} b^{n} + 1|n > 0} Which of the following is correct ?
i ➥ L_{1} is context free language and L_{2} is not context free language
ii ➥ L_{1} is not context free language and L_{2} is context free language
iii ➥ Both L_{1} and L_{2} are context free languages
iv ➥ Both L_{1} and L_{2} are not context free languages
Q101➡| NET December 2015 Paper III Consider a language A defined over the alphabet Σ={0, 1} as A={0^{⌊n/2⌋}1^{n} :n>=0}. The expression ⌊n/2⌋ means the floor of n/2, or what you get by rounding n/2 down to the nearest integer. Which of the following is not an example of a string in A?
Q103➡| NET JUNE 2015 Paper III The regular expression corresponding to the language L where L = { x ε {0, 1}*|x ends with 1 and does not contain substring 00 } is:
Q106➡| NET JUNE 2015 Paper III Given the following two statements: S1 : If L1 and L2 are recursively enumerable languages over ∑ , then L1 ∪ L2 and L2 ∩ L2 are also recursively enumerable. S2 : The set of recursively enumerable languages is countable. Which of the following is correct ?
Q107➡| NET JUNE 2015 Paper III Given the following grammars: G1 : S → AB|aaB A → aA | ∈ B → bB | ∈ G2: S → A|B A → aAb | ab B → abB | ∈ Which of the following is correct?
i ➥ G1 is ambiguous and G2 is unambiguous grammars
ii ➥ G1 is unambiguous and G2 is ambiguous grammars
Q108➡| NET Dec 2014 Paper III Given two languages : L_{1} = {(ab)^{n} a^{k} | n > k, k ≥ 0} L_{2} = {a^{n} b^{m} | n ≠ m} Using pumping lemma for regular language, it can be shown that
i ➥ L_{1} is regular and L_{2} is not regular
ii ➥ L_{1} is not regular and L_{2} is regular
iii ➥ L_{1} is regular and L_{2} is regular
iv ➥ L_{1} is not regular and L_{2} is not regular
Q110➡| NET Dec 2014 Paper III Given the recursively enumerable language (L_{RE}), the context sensitive language (L_{CS}), the recursive language (L_{REC}), the context free language (L_{CF}) and deterministic context free language (L_{DCF}). The relationship between these families is given by
Q112➡| NET Dec 2014 Paper III According to pumping lemma for context free languages : Let L be an infinite context free language, then there exists some positive integer m such that any w ∈ L with | w | ≥ m can be decomposed as w = u v x y z
i ➥ with | vxy | ≤ m such that uvi xyi z ∈ L for all i = 0, 1, 2
ii ➥ with | vxy | ≤ m, and | vy | ≥ 1, such that uv^{i} xy^{i} z ∈ L for all i = 0, 1, 2, …….
iii ➥ with | vxy | ≥ m, and | vy | ≤ 1, such that uv^{i} xy^{i} z ∈ L for all i = 0, 1, 2, …….
iv ➥ with | vxy | ≥ m, and | vy | ≥ 1, such that uv^{i} xy^{i} z ∈ L for all i = 0, 1, 2, …….
Q114➡| NET JUNE 2014 Paper II The regular grammar for the language L = {w|na(w) and nb(w) are both even, w ∈ {a, b}*} is given by : (Assume, p, q, r and s are states)
i ➥ p → aq | br | λ, q → bs | ap r → as | bp, s → ar | bq, p and s are initial and final states.
ii ➥ p → aq | br, q → bs | ap r → as | bp, s → ar | bq, p and s are initial and final states.
iii ➥ p → aq | br | λ, q → bs | ap r → as | bp, s → ar | bq p is both initial and final states.
iv ➥ p → aq | br, q → bs | ap r → as | bp, s → ar | bq p is both initial and final states
Q115➡| NET JUNE 2014 Paper III Let L be any language. Define even (W) as the strings obtained by extracting from W the letters in the even-numbered positions and even(L) = {even (W) | W ∈ L}. We define another language Chop (L) by removing the two leftmost symbols of every string in L given by Chop(L) = {W | ν W ∈ L, with | ν | = 2}. If L is regular language then
i ➥ even(L) is regular and Chop(L) is not regular
ii ➥ Both even(L) and Chop(L) are regular
iii ➥ even(L) is not regular and Chop(L) is regular
Q117➡| NET JUNE 2014 Paper III Given the following two languages : L1 = {a^{n}b^{n} | n > 1} ∪ {a} L2 = {w C w^{R} | w ∈ {a, b}*} Which statement is correct ?
i ➥ Both L1 and L2 are not deterministic.
ii ➥ L1 is not deterministic and L2 is deterministic
iii ➥ L1 is deterministic and L2 is not deterministic