Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Which one of the following statements is FALS...
Start Learning for Free
Which one of the following statements is FALSE?
- a)There exist context-free languages such that all the context-free grammars generating them are ambiguous
- b)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.
- c)Both deterministic and non-deterministic pushdown automata always accept the same set of languages
- d)A finite set of string from one alphabet is always a regular language.
Correct answer is option 'C'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
Which one of the following statements is FALSE?a)There exist context-f...
A) For real-world programming languages, the reference CFG is often ambiguous, due to issues such as the dangling else problem. //Wikipedia
B) A string is ambiguous if it has two distinct parse trees;The grammar is unambiguous,if a string has distinct parse trees.
C) Deterministic pushdown automata can recognize all deterministic context-free languages while nondeterministic ones can recognize all context-free languages
Therefore it's FALSE
D)Properties of Regular Language:
- The set of regular languages over an alphabet ∑ is closed under operations union, concatenation and Kleene star.
- Finite languages are regular
So Answer is C
Most Upvoted Answer
Which one of the following statements is FALSE?a)There exist context-f...
False Statement: Both deterministic and non-deterministic pushdown automata always accept the same set of languages.
Explanation:
Deterministic Pushdown Automata (DPDA) and Non-deterministic Pushdown Automata (NPDA) are two types of pushdown automata. DPDA has a deterministic transition function, while NPDA has a non-deterministic transition function.
DPDA and NPDA accept different sets of languages. Some languages accepted by NPDA cannot be accepted by DPDA, and vice versa. This is because NPDA can explore multiple paths at the same time and accept a string if any of the paths lead to an accepting state, while DPDA can only follow one path at a time.
For example, the language {0^n 1^n | n ≥ 0} can be accepted by an NPDA but not by a DPDA. In an NPDA, we can push all the 0s onto the stack, and then pop them off as we read the 1s. However, in a DPDA, we cannot keep track of the number of 0s we have seen and match them with the same number of 1s later.
Therefore, option C is false because DPDA and NPDA do not always accept the same set of languages.
Summary:
- DPDA and NPDA are two types of pushdown automata.
- DPDA has a deterministic transition function, while NPDA has a non-deterministic transition function.
- DPDA and NPDA accept different sets of languages.
- NPDA can explore multiple paths at the same time and accept a string if any of the paths lead to an accepting state, while DPDA can only follow one path at a time.
- Option C is false because DPDA and NPDA do not always accept the same set of languages.
Explanation:
Deterministic Pushdown Automata (DPDA) and Non-deterministic Pushdown Automata (NPDA) are two types of pushdown automata. DPDA has a deterministic transition function, while NPDA has a non-deterministic transition function.
DPDA and NPDA accept different sets of languages. Some languages accepted by NPDA cannot be accepted by DPDA, and vice versa. This is because NPDA can explore multiple paths at the same time and accept a string if any of the paths lead to an accepting state, while DPDA can only follow one path at a time.
For example, the language {0^n 1^n | n ≥ 0} can be accepted by an NPDA but not by a DPDA. In an NPDA, we can push all the 0s onto the stack, and then pop them off as we read the 1s. However, in a DPDA, we cannot keep track of the number of 0s we have seen and match them with the same number of 1s later.
Therefore, option C is false because DPDA and NPDA do not always accept the same set of languages.
Summary:
- DPDA and NPDA are two types of pushdown automata.
- DPDA has a deterministic transition function, while NPDA has a non-deterministic transition function.
- DPDA and NPDA accept different sets of languages.
- NPDA can explore multiple paths at the same time and accept a string if any of the paths lead to an accepting state, while DPDA can only follow one path at a time.
- Option C is false because DPDA and NPDA do not always accept the same set of languages.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer?
Question Description
Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer?.
Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer?.
Solutions for Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer?, a detailed solution for Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer? has been provided alongside types of Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Which one of the following statements is FALSE?a)There exist context-free languages such that all the context-free grammars generating them are ambiguousb)An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.c)Both deterministic and non-deterministic pushdown automata always accept the same set of languagesd)A finite set of string from one alphabet is always a regular language.Correct answer is option 'C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup