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

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
by

1 Answer

Answer :

e) The intersection two context-free languages is context-free
by

Related questions

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

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.

Which of the following statement is true? a) Not all formal languages are context-free b) All formal languages are Context free c) All formal languages are like natural language d) Natural languages are context-oriented free e) Natural language is formal

Description : Which of the following statement is true? a) Not all formal languages are context-free b) All formal languages are Context free c) All formal languages are like natural language d) Natural languages are context-oriented free e) Natural language is formal

Last Answer : a) Not all formal languages are context-free

Which of the following statement is true? a) Not all formal languages are context-free b) All formal languages are Context free c) All formal languages are like natural language d) Natural languages are context-oriented free

Description : Which of the following statement is true? a) Not all formal languages are context-free b) All formal languages are Context free c) All formal languages are like natural language d) Natural languages are context-oriented free

Last Answer : a) Not all formal languages are context-free

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.

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. 

Chomsky’s linguistic computational theory generated a model for syntactic analysis through __________ A. Regular Grammar B. Regular Expression C. Regular Word D. None of these

Description : Chomsky’s linguistic computational theory generated a model for syntactic analysis through __________ A. Regular Grammar B. Regular Expression C. Regular Word D. None of these

Last Answer : A. Regular Grammar

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

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:

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|λ

What is a finite set of rules that specifies a language? a) Signs b) Communication c) Grammar d) Phrase

Description : What is a finite set of rules that specifies a language? a) Signs b) Communication c) Grammar d) Phrase

Last Answer : c) Grammar

What are the two subfields of Natural language processing? a) context and expectations b) generation and understanding c) semantics of pragmatics d) recognition and synthesis

Description : What are the two subfields of Natural language processing? a) context and expectations b) generation and understanding c) semantics of pragmatics d) recognition and synthesis

Last Answer : b) generation and understanding

People overcome natural language problems by _____________ a) grouping attributes into frames b) understanding ideas in context c) identifying with familiar situations d) both understanding ideas in context & identifying with familiar situations

Description : People overcome natural language problems by _____________ a) grouping attributes into frames b) understanding ideas in context c) identifying with familiar situations d) both understanding ideas in context & identifying with familiar situations

Last Answer : d) both understanding ideas in context & identifying with familiar situations

There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Description : There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Last Answer : 1) Intersection Search

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 family of context sensitive languages is ................. under union and ................. under reversal. (A) closed, not closed (B) not closed, not closed (C) closed, closed (D) not closed, closed

Description : The family of context sensitive languages is ................. under union and ................. under reversal. (A) closed, not closed (B) not closed, not closed (C) closed, closed (D) not closed, closed

Last Answer : (C) closed, closed 

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.

The regular expression for the complement of the language L = {anbm|n≥4, m≤3} is: (A) (λ + a + aa + aaa)b* + a*bbbb* + (a + b)*ba(a + b)* (B) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ab(a + b)* (C) (λ + a + aa + aaa) + a*bbbbb* + (a + b)*ab(a + b)* (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*

Description : The regular expression for the complement of the language L = {anbm|n≥4, m≤3} is: (A) (λ + a + aa + aaa)b* + a*bbbb* + (a + b)*ba(a + b)* (B) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ab(a + b)* (C) (λ + a ... *bbbbb* + (a + b)*ab(a + b)* (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*

Last Answer : (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*

Speakers of other languages: when someone asks a question about grammar in your language (please name it), does it incite as much controversy and produce as much heated disagreement as do English grammar questions here on Fluther?

Description : Speakers of other languages: when someone asks a question about grammar in your language (please name it), does it incite as much controversy and produce as much heated disagreement as do English grammar questions here on Fluther?

Last Answer : It can, as Finnish grammar is extremely complicated (14 different cases and 7 different verb endings)

The statement comprising the limitations of FOL is/are ____________ a) Expressiveness b) Formalizing Natural Languages c) Many-sorted Logic d) All of the mentioned

Description : The statement comprising the limitations of FOL is/are ____________ a) Expressiveness b) Formalizing Natural Languages c) Many-sorted Logic d) All of the mentioned

Last Answer : d) All of the mentioned

NLP is concerned with the interactions between computers and human (natural) languages. a) True b) False

Description : NLP is concerned with the interactions between computers and human (natural) languages. a) True b) False

Last Answer : a) True

Planning problem can be described as a propositional logic. a) True b) False

Description : Planning problem can be described as a propositional logic. a) True b) False

Last Answer : a) True

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 

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

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

Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is because each perceptron can partition off a linear part of the space itself, and they can then combine their results. a) True – this works always, and these multiple perceptrons learn to classify even complex problems. b) False – perceptrons are mathematically incapable of solving linearly inseparable functions, no matter what you do c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded d) False – just having a single perceptron is enough

Description : Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is because each perceptron can partition off a linear part of the space itself, and they can then combine their results. ... have to be explicitly hand-coded d) False - just having a single perceptron is enough

Last Answer : c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded

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. 

Semantic grammars are _____________ a) Encode semantic information into a syntactic grammar b) Decode semantic information into a syntactic grammar c) Encode syntactic information into a semantic grammar d) Decode syntactic information into a semantic grammar

Description : Semantic grammars are _____________ a) Encode semantic information into a syntactic grammar b) Decode semantic information into a syntactic grammar c) Encode syntactic information into a semantic grammar d) Decode syntactic information into a semantic grammar

Last Answer : a) Encode semantic information into a syntactic grammar

What is used to augment a grammar for arithmetic expression with semantics? a) Notation b) DCG notation c) Constituent d) All of the mentioned

Description : What is used to augment a grammar for arithmetic expression with semantics? a) Notation b) DCG notation c) Constituent d) All of the mentioned

Last Answer : b) DCG notation

Translate the following statement into FOL. “For every a, if a is a PhD student, then a has a master degree” a) ∀ a PhD(a) -> Master(a) b) ∃ a PhD(a) -> Master(a) c) A is true, B is true d) A is false, B is false

Description : Translate the following statement into FOL. “For every a, if a is a PhD student, then a has a master degree” a) ∀ a PhD(a) -> Master(a) b) ∃ a PhD(a) -> Master(a) c) A is true, B is true d) A is false, B is false

Last Answer : a) ∀ a PhD(a) -> Master(a)

How the distance between two shapes can be defined? a) Weighted sum of the shape b) Size of the shape c) Shape context d) None of the mentioned

Description : How the distance between two shapes can be defined? a) Weighted sum of the shape b) Size of the shape c) Shape context d) None of the mentioned

Last Answer : a) Weighted sum of the shape

Can PDF concatenation be solved with a free program?

Description : I should concatenate a PDF. There are paid programs for it, but is there a free solution that works well?

Last Answer : I use a program called PDFStapler for this, which is completely free and can be downloaded HERE. You will download a compressed file that needs to be extracted and you can start the program. The ... the name of the concatenated file, which is created. Then click STAPLE MUSHROOMS and you're done.   

Which approach to speech recognition avoids the problem caused by the differences in the way words are pronounced according to context? a) continuous speech recognition b) connected word recognition c) isolated word recognition d) speaker-dependent recognition

Description : Which approach to speech recognition avoids the problem caused by the differences in the way words are pronounced according to context? a) continuous speech recognition b) connected word recognition c) isolated word recognition d) speaker-dependent recognition

Last Answer : c) isolated word recognition

Many words have more than one meaning; we have to select the meaning which makes the most sense in context. This can be resolved by ____________ a) Fuzzy Logic b) Word Sense Disambiguation c) Shallow Semantic Analysis d) All of the mentioned

Description : Many words have more than one meaning; we have to select the meaning which makes the most sense in context. This can be resolved by ____________ a) Fuzzy Logic b) Word Sense Disambiguation c) Shallow Semantic Analysis d) All of the mentioned

Last Answer : b) Word Sense Disambiguation

Which describes the coarse arrangement of the rest of the shape with respect to the point? a) Shape b) Context c) Shape context d) None of the mentioned

Description : Which describes the coarse arrangement of the rest of the shape with respect to the point? a) Shape b) Context c) Shape context d) None of the mentioned

Last Answer : c) Shape context

What kind of interpretation is done by adding context-dependant information? a) Semantic b) Syntactic c) Pragmatic d) None of the mentioned

Description : What kind of interpretation is done by adding context-dependant information? a) Semantic b) Syntactic c) Pragmatic d) None of the mentioned

Last Answer : c) Pragmatic

Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False

Description : Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False

Last Answer : b) False

Point out the correct statement. a) Platforms can be based on specific types of development languages, application frameworks, or other constructs b) SaaS is the cloud-based equivalent of shrink-wrapped software c) Software as a Service (SaaS) may be succinctly described as software that is deployed on a hosted service d) All of the mentioned

Description : Point out the correct statement. a) Platforms can be based on specific types of development languages, application frameworks, or other constructs b) SaaS is the cloud-based equivalent of shrink- ... succinctly described as software that is deployed on a hosted service d) All of the mentioned

Last Answer : All of the mentioned

Point out the correct statement. A. Platforms can be based on specific types of development languages, application frameworks, or other constructs B. SaaS is the cloud-based equivalent of shrink-wrapped software C. Software as a Service (SaaS) may be succinctly described as software that is deployed on a hosted service D. All of the above

Description : Point out the correct statement. A. Platforms can be based on specific types of development languages, application frameworks, or other constructs B. SaaS is the cloud-based equivalent of shrink-wrapped ... succinctly described as software that is deployed on a hosted service D. All of the above

Last Answer : All of the above

Point out the correct statement. a) Platforms can be based on specific types of development languages, application frameworks, or other constructs b) SaaS is the cloud-based equivalent of shrink-wrapped software c) Software as a Service (SaaS) may be succinctly described as software that is deployed on a hosted service d) All of the mentioned

Description : Point out the correct statement. a) Platforms can be based on specific types of development languages, application frameworks, or other constructs b) SaaS is the cloud-based equivalent of shrink- ... succinctly described as software that is deployed on a hosted service d) All of the mentioned

Last Answer : All of the mentioned

What is the complex system of structured message? a) Languages b) Words c) Signs d) Speech

Description : What is the complex system of structured message? a) Languages b) Words c) Signs d) Speech

Last Answer : a) Languages

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.

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

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

What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Description : What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Last Answer : d) Decision tree

How does the state of the process is described in HMM? a) Literal b) Single random variable c) Single discrete random variable d) None of the mentioned

Description : How does the state of the process is described in HMM? a) Literal b) Single random variable c) Single discrete random variable d) None of the mentioned

Last Answer : c) Single discrete random variable

How the compactness of the bayesian network can be described? a) Locally structured b) Fully structured c) Partial structure d) All of the mentioned

Description : How the compactness of the bayesian network can be described? a) Locally structured b) Fully structured c) Partial structure d) All of the mentioned

Last Answer : a) Locally structured

Agents behavior can be best described by ____________ a) Perception sequence b) Agent function c) Sensors and Actuators d) Environment in which agent is performing

Description : Agents behavior can be best described by ____________ a) Perception sequence b) Agent function c) Sensors and Actuators d) Environment in which agent is performing

Last Answer : b) Agent function

Claude Shannon described the operation of electronic switching circuits with a system of mathematical logic called _____________ a) LISP b) XLISP c) Neural networking d) Boolean algebra

Description : Claude Shannon described the operation of electronic switching circuits with a system of mathematical logic called _____________ a) LISP b) XLISP c) Neural networking d) Boolean algebra

Last Answer : c) Neural networking

Which stage of the manufacturing process has been described as “the mapping of function onto form”? a) Design b) Distribution c) Project management d) Field service

Description : Which stage of the manufacturing process has been described as “the mapping of function onto form”? a) Design b) Distribution c) Project management d) Field service

Last Answer : a) Design

What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Description : What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Last Answer : d) Decision tree