Multiple Choice
The following grammar
G = (N, T, P, S)
N = {S, A, B}
T = {a, b, c}
P : S ? aSa
S ? aAa
A ? bB
B ? bB
B ? c is
A) is type 3
B) is type 2 but not type 3
C) is type 1 but not type 2
D) is type 0 but not type 1
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q35: Consider the following CFG S ? aB
Q36: Which of the following are regular sets?<br>A)I
Q37: Automaton accepting the regular expression of any
Q38: The regular sets are closed under:<br>A)Union<br>B)Concatenation<br>C)Kleene closure<br>D)All
Q39: Given a Non-deterministic Finite Automation (NFA) with
Q41: Which of the following statement is wrong?<br>A)Any
Q42: Which one of the following languages over
Q43: A language is regular if and only
Q44: P, Q, R are three languages. If
Q45: The following CFG is in S ?