Multiple Choice
Type-1 Grammar is known as_____________
A) CFG
B) CSG
C) REGULAR
D) All
Correct Answer:
Verified
Related Questions
Q31: A minimum state deterministic finite automation accepting
Q32: Let P be a regular language and
Q33: Given a Non-deterministic Finite Automation (NFA) with
Q34: Which one of the following statement is
Q35: The …………. is said to be ambiguous
Q37: If G is "S ? a S/a",
Q38: "S ?a S", what is the type
Q39: A?abA a type _productions
A)Type 0
B)Type 1
C)Type 2
D)Type
Q40: The following CFG is in S ?
Q41: The language accepted by a Push down
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents