Related MCQs

• The total number of states to build the given language using DFA:L= {w | w has exactly 2 a’s and at least 2 b’s}
• Predict the number of transitions required to automate the following language using only 3 states:L= {w | w ends with 00}
• 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?
• 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?
• PREDICT_THE_NUMBER_OF_TRANSITIONS_REQUIRED_TO_AUTOMATE_THE_FOLLOWING_LANGUAGE_USING_ONLY_3_STATES:?$
• The_total_number_of_states_to_build_the_given_language_using_DFA:$
• L1= {w | w does not contain the string tr ?
• Which among the following is not an application of FSM?
• Which among the following can be an example of application of finite state machine(FSM)?
• Which of the following do we use to form an NFA from a regular expression?