Finite Automata
Q41.
Match the following NFAs with the regular expressions they correspond to 1. \epsilon + 0(01*1 + 00) * 01* 2. \epsilon + 0(10 *1 + 00) * 0 3. \epsilon + 0(10 *1 + 10) *1 4. \epsilon + 0(10 *1 + 10) *10 *Q42.
Given below are two finite state automata (\rightarrow indicates the start state and F indicates a final state) Which of the following represents the product automaton ZxY?Q44.
Consider the following two finite automata. M_1 accepts L_1 and M_2 accepts L_2. Which one of the following is TRUE?Q45.
Consider the following DFA in which S_0 is the start state and S_1, S_3 are the final statesWhat language does this DFA recognize?