GATE 2022: Theory Of Computation Quiz-2

Identify the language accepted by the following NFA over

Consider the transition diagram of an DFA as given below:

Which should be the final state(s) of the DFA if it should accept strings starting with ‘a’ and ending with ‘b’.

Consider the following DFA:

The language we get first complementing then reversing the state diagram is:

The number of substrings present in the string “FINITE” is-

Find the minimum number of states in DFA of the following language : _____

L = {strings of 'a' | strings are of type (aa+aaa)^*}