COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Accepting State
|
|
|
Starting Variable
|
|
|
Sensitive Grammar
|
|
|
None of these
|
Detailed explanation-1: -G=(V, ∑, p, S), here V=Finite set of variables, ∑= set of terminals, p= finite productions, S= Starting Variable.
Detailed explanation-2: -grammar, rules of a language governing the sounds, words, sentences, and other elements, as well as their combination and interpretation. The word grammar also denotes the study of these abstract features or a book presenting these rules.
Detailed explanation-3: -1. variable noun. V is the twenty-second letter of the English alphabet. 2. V or v is an abbreviation for words beginning with v, such as ‘verse’, ‘versus’, ‘very’, and ‘volt’.
Detailed explanation-4: -Clarification: A context-free grammar (CFG) is a set of recursive rewriting rules (or productions) used to generate patterns of strings. 3.
Detailed explanation-5: -Which of the following statement is correct? Explanation: Regular grammar is a subset of context free grammar and thus all regular grammars are context free.