Question: L1= {w | w does not contain the string tr }^ L2= {w | w does contain the string tr}^ Given ?= {t, r}, The difference of the minimum number of states required to form L1 and L2?
Options
A : 0
B : 1
C : 2
D : Cannot be said
Applications of NFA more questions
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....
Which of the following is an application of Finite Automaton?
Which of the following options is correct for the given....
Left corner parsing methof uses which of the following?
Predict the number of transitions required to automate the following....
The total number of states to build the given language....
To derive a string using the production rules of a....
Which among the following can be an example of application....
Ambiguous Grammar more Online Exam Quiz
Applications of Pumping Lemma/Pigeonhole principle
CFG-Eliminating Useless Symbols
Deterministic Finite Automata-Introduction and Definition