Multiple Choice
Type-1 Grammar is known as_____________
A) CFG
B) CSG
C) REGULAR
D) All
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q4: Given an arbitrary non-deterministic finite automaton NFA
Q5: Which one of the following statement is
Q6: Grammars that can be translated to DFAs:<br>A)Left
Q7: Which of the following is true with
Q8: A language L is accepted by a
Q10: Let L<sub>1</sub> = {w ? {0,1}? |
Q11: Regular expressions are<br>A)Type 0 language<br>B)Type 1 language<br>C)Type
Q12: Let w be any string of length
Q13: Consider the regular language L = (111+111111)*.
Q14: Which of the following is TRUE?<br>A)Every subset