Question: John is asked to make an automaton which accepts a given string for all the occurrence of '1001' in it. How many number of transitions would John use such that, the string processing application works?
Options
A : 9
B : 11
C : 12
D : 15
Click to view Correct Answer
Applications of DFA more questions
Which of the following can be a LALR parser generator?
Which of the following is true for a predictive parser?
Which of the following is/are an example of pigeon hole....
Which of the following parsers do not relate to Bottom....
It is less complex to prove the closure properties over....
Let N (Q, ?, ?, q0, A) be the NFA....
Statement 1: NFA computes the string along parallel paths.^ Statement....
There exists an initial state, 17 transition states, 7 final....
Under which of the following operation, NFA is not closed?
Which of the following do we use to form an....
Ambiguous Grammar more Online Exam Quiz
Applications of Pumping Lemma/Pigeonhole principle
CFG-Eliminating Useless Symbols