GATE 2024 Theory of computation Foundation Quiz 86

Find the number of DFA’s with three states which can be constructed over the alphabet ∑ = {a, b} with designated initial state?

Find the number of DFA with 4 states which can be constructed over alphabet S = {0, 1, 2} with designated starting state and exactly 2 final states_____?

Which of the following is/are true?

Regular Expression for strings with odd number of b's over {a, b} is

The string "aaba" does not belong to the set represented by: