Given the following two statements: A. L = {w|na(w) = nb(w)} is deterministic context free language, but not linear B. L = {an bn} U {an b2n} is linear, but not deterministic context free language. Which of the following options is correct? (1) Both (A) and (B) are false. (2) Both (A) and (B) are true. (3) (A) is true, (B) is false. (4) (A) is false, (B) is true.

Given the following two statements:

A. L = {w|na(w) = nb(w)} is deterministic context free language, but not linear B. L = {an bn} U {an b2n} is linear, but not deterministic context free language.

Which of the following options is correct?

(1) Both (A) and (B) are false.

(2) Both (A) and (B) are true.

(3) (A) is true, (B) is false.

(4) (A) is false, (B) is true.
by

1 Answer

Answer :

Both (A) and (B) are true. 
by

Related questions

Given the following two languages: L1 = {anbn|n≥0, n≠100} L2 = {w ϵ {a,b,c}*| na(w) = nb(w) = nc(w)} Which of the following options is correct? (1) Both L1 and L2 are not context free language. (2) Both L1 and L2 are context free language. (3) L1 is context free language, L2 is not context free language. (4) L1 is not context free language, L2 is context free language.

Description : Given the following two languages: L1 = {anbn|n≥0, n≠100} L2 = {w ϵ {a,b,c}*| na(w) = nb(w) = nc(w)} Which of the following options is correct? (1) Both L1 and L2 are ... context free language, L2 is not context free language. (4) L1 is not context free language, L2 is context free language.

Last Answer : L1 is context free language, L2 is not context free language.

The transition function for the language L = {w|na(w) and nb(w) are both odd} is given by: δ(q0, a)=q1 ; δ(q0, b)=q2 δ(q1, a)=q0 ; δ(q1, b)=q3 δ(q2, a)=q3 ; δ(q2, b)=q0 δ(q3, a)=q2 ; δ(q3, b)=q1

Description : The transition function for the language L = {w|na(w) and nb(w) are both odd} is given by: δ(q0, a)=q1 ; δ(q0, b)=q2 δ(q1, a)=q0 ; δ(q1, b)=q3 δ(q2, a)=q3 ; δ(q2, b ... the automata are: (A) q0 and q0 respectively (B) q0 and q1 respectively (C) q0 and q2 respectively (D) q0 and q3 respectively 

Last Answer : (D) q0 and q3 respectively

The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≤ nb(v) where v is any prefix of w} (C) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Description : The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v ... (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

Last Answer : (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} 

Given the following statements: S1: Every context-sensitive language L is recursive. S2: There exists a recursive language that is not context sensitive. Which statement is correct? (A) S1 is not correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Description : Given the following statements: S1: Every context-sensitive language L is recursive. S2: There exists a recursive language that is not context sensitive. Which statement is correct? (A) S1 is not correct and S2 is ... (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Last Answer : (D) S1 is correct and S2 is correct. 

The Greibach normal form grammar for the language L={an bn+1|n≥0} is (A) S→a SB, B→bB|λ (B) S→a SB, B→bB|b (C) S→a SB|b, B→b (D) S→a Sb|b

Description : The Greibach normal form grammar for the language L={an bn+1|n≥0} is (A) S→a SB, B→bB|λ (B) S→a SB, B→bB|b (C) S→a SB|b, B→b (D) S→a Sb|b

Last Answer : (C) S→a SB|b, B→b 

Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct? (1) Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

Description : Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by ... Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

Last Answer : Answer: 4

Minimal deterministic finite automaton for the language L={ 0n | n≥0, n≠4 } will have: (A) 1 final state among 5 states (B) 4 final states among 5 states (C) 1 final state among 6 states (D) 5 final states among 6 states

Description : Minimal deterministic finite automaton for the language L={ 0n | n≥0, n≠4 } will have: (A) 1 final state among 5 states (B) 4 final states among 5 states (C) 1 final state among 6 states (D) 5 final states among 6 states

Last Answer : (D) 5 final states among 6 states

Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Description : Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (D) 6

A context free grammar for L={w|n0(w)>n1(w)} is given by: (A) S→0|0S|1SS (B) S→0S|1S|0SS|1SS|0|1 (C) S→0|0S|1SS|S1S|SS1 (D) S→0S|1S|0|1

Description : A context free grammar for L={w|n0(w)>n1(w)} is given by: (A) S→0|0S|1SS (B) S→0S|1S|0SS|1SS|0|1 (C) S→0|0S|1SS|S1S|SS1 (D) S→0S|1S|0|1

Last Answer : (C) S→0|0S|1SS|S1S|SS1 

Given the following statements : S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to the parser. S2 : LR grammar is a larger sub-class of context free grammar as compared to that SLR and LALR grammars. Which of the following is true ? (A) S1 is not correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Description : Given the following statements : S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to ... (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Last Answer : (D) S1 is correct and S2 is correct.

Which of the following statements is false? (1) Every context-sensitive language is recursive. (2) The set of all languages that are not recursively enumerable is countable. (3) The family of recursively enumerable languages is closed under union. (4) The families of recursively enumerable and recursive languages are closed under reversal.

Description : Which of the following statements is false? (1) Every context-sensitive language is recursive. (2) The set of all languages that are not recursively enumerable is countable. (3) The family ... under union. (4) The families of recursively enumerable and recursive languages are closed under reversal.

Last Answer : The set of all languages that are not recursively enumerable is countable.

The statements s1 and s2 are given as: s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism. s2: Context free languages are closed under complementation, substitution and homomorphism. Which of the following is correct statement? (A) Both s1 and s2 are correct. (B) s1 is correct and s2 is not correct. (C) s1 is not correct and s2 is correct. (D) Both s1 and s2 are not correct.

Description : The statements s1 and s2 are given as: s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism. s2: Context free languages are closed under complementation, ... is not correct and s2 is correct. (D) Both s1 and s2 are not correct.

Last Answer : (B) s1 is correct and s2 is not correct.

The context free grammar for the language L = {an bm | n≤m+3, n≥0, m≥0} is (A) S→aaaA; A→aAb|B, B→Bb|λ (B) S→aaaA|λ, A→aAb|B, B→Bb|λ (C) S→aaaA|aaA|λ, A→aAb|B, B→Bb|λ (D) S→aaaA|aaA|aA|λ, A→aAb|B, B→Bb|λ

Description : The context free grammar for the language L = {an bm | n≤m+3, n≥0, m≥0} is (A) S→aaaA; A→aAb|B, B→Bb|λ (B) S→aaaA|λ, A→aAb|B, B→Bb|λ (C) S→aaaA|aaA|λ, A→aAb|B, B→Bb|λ (D) S→aaaA|aaA|aA|λ, A→aAb|B, B→Bb|λ

Last Answer : (D) S→aaaA|aaA|aA|λ, A→aAb|B, B→Bb|λ

Given the following statements: (a) Strategic value of data mining is time stamping (b) Information collection is an expensive process in building an expert system. Which of the following options is correct ? (A) Both (a) and (b) are false (B) Both (a) and (b) are true (C) (a) is true, (b) is false (D) (a) is false, (b) is true

Description : Given the following statements: (a) Strategic value of data mining is time stamping (b) Information collection is an expensive process in building an expert system. Which of the following options is correct ? (A) Both (a) and (b) ... true (C) (a) is true, (b) is false (D) (a) is false, (b) is true

Last Answer :  (B) Both (a) and (b) are true

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? (1) Both (A) and (B) are false. (2) Both (A) and (B) are true. (3) (A) is true, (B) is false. (4) (A) is false, (B) is true.

Description : 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 ... (3) (A) is true, (B) is false. (4) (A) is false, (B) is true.

Last Answer : (A) is true, (B) is false. 

For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3

Description : For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3

Last Answer : (D) |w|3

Given the following statements : S1 : If L is a regular language then the language {uv | uϵL, vϵLR} is also regular. S2 : L = {wwR} is regular language. Which of the following is true ? (A) S1 is not correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Description : Given the following statements : S1 : If L is a regular language then the language {uv | uϵL, vϵLR} is also regular. S2 : L = {wwR} is regular language. Which of the following is true ? (A) S1 is not ... S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Last Answer : (C) S1 is correct and S2 is not correct.

Consider the following two statements : (a) Data scrubling is a process to upgrade the quality of data, before it is moved into Data warehouse. (b) Data scrubling is a process of rejecting data from data warehouse to create indexes. Which one of the following options is correct ? (A) (a) is true, (b) is false (B) (a) is false, (b) is true (C) Both (a) and (b) are false (D) Both (a) and (b) are true

Description : Consider the following two statements : (a) Data scrubling is a process to upgrade the quality of data, before it is moved into Data warehouse. (b) Data scrubling is a process of rejecting data from data warehouse to create ... true (C) Both (a) and (b) are false (D) Both (a) and (b) are true

Last Answer : (A) (a) is true, (b) is false

Consider the following two statements: (a) Business intelligence and Data warehousing is used for forecasting and Data mining. (b) Business intelligence and Data warehousing is used for analysis of large volumes of sales data. Which one of the following options is correct? (A) (a) is true, (b) is false (B) Both (a) and (b) are true (C) (a) is false, (b) is true (D) Both (a) and (b) are false

Description : Consider the following two statements: (a) Business intelligence and Data warehousing is used for forecasting and Data mining. (b) Business intelligence and Data warehousing is used for analysis of large volumes of sales data. Which one ... C) (a) is false, (b) is true (D) Both (a) and (b) are false

Last Answer : (B) Both (a) and (b) are true

Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below Image The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Description : Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below  The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Last Answer : (C) 3 

The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Description : The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Last Answer : (C) Four Explanation:

A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one element (s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Description : A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one ... ) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Last Answer : (C) both s1 and s2

The value of NA/(NA + NB), for steady state equimolal counter diffusion of two gases 'A' and 'B' is (A) 1 (B) ∞ (C) 0.5

Description : The value of NA/(NA + NB), for steady state equimolal counter diffusion of two gases 'A' and 'B' is (A) 1 (B) ∞ (C) 0.5

Last Answer : (B) ∞

The value of NA/(NA + NB) for steady state molecular diffusion of gas 'A' through non-diffusing gas 'B' is (A) 1 (B) ∞ (C) 0.5 (D) 2

Description : The value of NA/(NA + NB) for steady state molecular diffusion of gas 'A' through non-diffusing gas 'B' is (A) 1 (B) ∞ (C) 0.5 (D) 2

Last Answer : (A) 1

Which of the following statements is/are true w.r.t. Enterprise Resource Planning (ERP)? (A) ERP automates and integrates majority of business processes. (B) ERP provides access to information in a Real Time Environment. (C) ERP is inexpensive to implement. (1) (A), (B) and (C) are false. (2) (A) and (B) false; (C) true. (3) (A) and (B) true; (C) false (4) (A) true; (B) and (C) are false

Description : Which of the following statements is/are true w.r.t. Enterprise Resource Planning (ERP)? (A) ERP automates and integrates majority of business processes. (B) ERP provides access to information in a Real Time Environment. (C) ERP is ... (A) and (B) true; (C) false (4) (A) true; (B) and (C) are false

Last Answer : Answer: 3

In ……………… system the interaction between various subsystems cannot be defined with certainty A) Open System B) Closed System C) Deterministic System D) Probabilistic System

Description : In ……………… system the interaction between various subsystems cannot be defined with certainty A) Open System B) Closed System C) Deterministic System D) Probabilistic System

Last Answer : D) Probabilistic System

………… is a good example of deterministic system. A) Life cycle B) Computer Program C) Software Program D) None of the above

Description : ………… is a good example of deterministic system. A) Life cycle B) Computer Program C) Software Program D) None of the above

Last Answer : B) Computer Program

Which of the following pairs have different expressive power? (1) Single-tape-turing machine and multi-dimensional turing machine. (2) Multi-tape turing machine and multi-dimensional turing machine. (3) Deterministic push down automata and non-deterministic pushdown automata. (4) Deterministic finite automata and Non-deterministic finite automata.

Description : Which of the following pairs have different expressive power? (1) Single-tape-turing machine and multi-dimensional turing machine. (2) Multi-tape turing machine and multi-dimensional ... non-deterministic pushdown automata. (4) Deterministic finite automata and Non-deterministic finite automata.

Last Answer : Deterministic push down automata and non-deterministic pushdown automata.

Which one of the following statements is correct in the context of multiple - choice type questions? (A) They are more objective than true-false type questions. (B) They are less objective than essay type questions. (C) They are more subjective than short-answer type questions. (D) They are more subjective than true-false type questions.

Description : Which one of the following statements is correct in the context of multiple - choice type questions? (A) They are more objective than true-false type questions. (B) They are less objective ... than short-answer type questions. (D) They are more subjective than true-false type questions.

Last Answer : (A) They are more objective than true-false type questions.

Which of the following statements is true? A. PERT is considered as a deterministic approach and CPM is a probabilis t ic techniques. B. PERT is considered as a probabilistic techniques and CPM is considered as a deterministic approach. C. PERT and CPM are both probabilistic techniques. D. PERT and CPM are both considered as deterministic approachs

Description : Which of the following statements is true? A. PERT is considered as a deterministic approach and CPM is a probabilis t ic techniques. B. PERT is considered as a probabilistic techniques ... and CPM are both probabilistic techniques. D. PERT and CPM are both considered as deterministic approachs

Last Answer : B. PERT is considered as a probabilistic techniques and CPM is considered as a deterministic approach

Given L1 = L(a*baa*) and L2 = L(ab*) The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by (A) a*b (B) a*baa* (C) a*ba* (D) None of the above

Description : Given L1 = L(a*baa*) and L2 = L(ab*) The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by (A) a*b (B) a*baa* (C) a*ba* (D) None of the above

Last Answer : (C) a*ba* 

Given the following statements: S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not equivalent. S2: The grammars S→ss | sss | asb | bsa | λ and S→ss | asb | bsa | λ are equivalent. Which of the following is true? (A) S1 is correct and S2 is not correct. (B) Both S1 and S2 are correct (C) S1 is not correct and S2 is correct (D) Both S1 and S2 are not correct.

Description : Given the following statements: S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not equivalent. S2: The grammars S→ss | sss | asb | bsa | λ and S→ss | asb | bsa | λ are equivalent. ... and S2 are correct (C) S1 is not correct and S2 is correct (D) Both S1 and S2 are not correct.

Last Answer : (A) S1 is correct and S2 is not correct.

Which of the following is/are true w.r.t. applications of mobile computing? (A) Travelling of salesman (B) Location awareness services (1) (A) true; (B) false (2) Both (A) and (B) are true. (3) Both (A) and (B) are false. (4) (A) false; (B) true.

Description : Which of the following is/are true w.r.t. applications of mobile computing? (A) Travelling of salesman (B) Location awareness services (1) (A) true; (B) false (2) Both (A) and (B) are true. (3) Both (A) and (B) are false. (4) (A) false; (B) true.

Last Answer : Answer: 2

Statement (A). In the context of globalisation, the most important challenge facing India is to boost exports. Reason (R). It may increase the country's growth rate. A. Both (A) and (R) are true and (R) is the correct explanation of (A). B. Both (A) and (R) are true and (R) is the uncorrect explanation of (A). C. (A) is true but (R) is false. D. (A) is false but (R) is true.

Description : Statement (A). In the context of globalisation, the most important challenge facing India is to boost exports. Reason (R). It may increase the country's growth rate. A. Both (A) and (R) are true and (R) is the correct ... (A). C. (A) is true but (R) is false. D. (A) is false but (R) is true.

Last Answer : A). B. Both (A) and (R) are true and

If all the production rules have single non - terminal symbol on the left side, the grammar defined is : (A) context free grammar (B) context sensitive grammar (C) unrestricted grammar (D) phrase grammar

Description : If all the production rules have single non - terminal symbol on the left side, the grammar defined is : (A) context free grammar (B) context sensitive grammar (C) unrestricted grammar (D) phrase grammar

Last Answer : (A) context free grammar

Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) Given the prefix and postfix walks of a binary tree, the tree cannot be reconstructed uniquely. (D) Depth-first-search can be used to find the components of a graph. (1) A (2) B (3) C (4) D

Description : Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) ... used to find the components of a graph. (1) A (2) B (3) C (4) D 

Last Answer : Answer: 2

The teacher has been glorified by the phrase 'Friend, Philosopher and Guide' because Options: A) He has to play all these vital roles in context of the society B) He transfuses the high values of the humanity into young ones sitting in the class-room C) He is the great reformer and patriotic saviour of a nation D) All the above statements are true

Description : The teacher has been glorified by the phrase 'Friend, Philosopher and Guide' because Options: A) He has to play all these vital roles in context of the society B) He transfuses the high values ... ) He is the great reformer and patriotic saviour of a nation D) All the above statements are true

Last Answer : He transfuses the high values of the humanity into young ones sitting in the class-room

Which command is used to change protection mode of files starting with the string emp and ending with 1,2, or 3? A. chmod u+x emp[l-3] B. chmod 777 emp* C. chmod u+r ??? emp D. chmod 222 emp? E. None of the above

Description : Which command is used to change protection mode of files starting with the string emp and ending with 1,2, or 3? A. chmod u+x emp[l-3] B. chmod 777 emp* C. chmod u+r ??? emp D. chmod 222 emp? E. None of the above

Last Answer : A. chmod u+x emp[l-3]

State true or false for the following statements in Java. i) Java beans slow down software development process. ii) Java Servlets do not have built in multithreading feature. A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Description : State true or false for the following statements in Java. i) Java beans slow down software development process. ii) Java Servlets do not have built in multithreading feature. A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Last Answer : A) i-false, ii-false

Which of the following statements is not correct? (A) HTML is not screen precise formatting language. (B) HTML does not specify a logic. (C) DHTML is used for developing highly interactive web pages. (D) HTML is a programming language.

Description : Which of the following statements is not correct? (A) HTML is not screen precise formatting language. (B) HTML does not specify a logic. (C) DHTML is used for developing highly interactive web pages. (D) HTML is a programming language.

Last Answer : (D) HTML is a programming language.

Given the following two statements: S1: If L1 and L2 are recursively enumerable languages over ∑, then L1⋃L2 and L1⋂L2 are also recursively enumerable. S2: The set of recursively enumerable languages is countable. Which of the following is correct? (A) S1 is correct and S2 is not correct (B) S1 is not correct and S2 is correct (C) Both S1 and S2 are not correct (D) Both S1 and S2 are correct

Description : Given the following two statements: S1: If L1 and L2 are recursively enumerable languages over ∑, then L1⋃L2 and L1⋂L2 are also recursively enumerable. S2: The set of recursively enumerable languages is countable. ... correct (C) Both S1 and S2 are not correct (D) Both S1 and S2 are correct

Last Answer : (D) Both S1 and S2 are correct

Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but the complement need not be c) Every regular language is context-free because it can be described by a regular grammar d) The intersection two context-free languages is context-free

Description : Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but the ... it can be described by a regular grammar d) The intersection two context-free languages is context-free

Last Answer : d) The intersection two context-free languages is context-free

Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but the complement need not be c) Every regular language is context-free because it can be described by a regular grammar d) The intersection of a context-free language and a regular language is always context-free e) The intersection two context-free languages is context-free

Description : Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but ... a regular language is always context-free e) The intersection two context-free languages is context-free

Last Answer : e) The intersection two context-free languages is context-free