Question: Given Language: {x | it is divisible by 3}^ The total number of final states to be assumed in order to pass the number constituting {0, 1} is
Options
A : 0
B : 1
C : 2
D : 3
Click to view Correct Answer
Ambiguous Grammar more questions
Which of the following is not the style of inference?
A binary string is divisible by 4 if and only....
A language that admits only ambiguous grammar:
CFGs can be parsed in polynomial time using__
If L1 and L2 are regular languages, which among the....
In context to ambiguity, the number of times the following....
Let L be a language whose FA consist of 5....
Predict the analogous operation for the given language:^ A: {[p,....
State true or false:^ Statement: R->R|T T->? is an ambiguous....
Ambiguous Grammar more Online Exam Quiz
Natural Language Processing - 2