Consider the following Finite State Automaton:

The minimum state automaton equivalent to the above FSA has the following number of states

Keep practicing — related questions

• Given an arbitary non-deterministic finite automaton (NFA) with N states, the maximum number of states in a...
• A minimum state deterministic finite automaton accepting the language L = {w | w $\in${0, 1}*, number of 0s...
• A minimum state deterministic finite automaton accepting the language L = {w | w $\in${0, 1}*, number of 0s...
• Let w be any string of length n in {0, 1}*. Let L be the set of all substrings of w. What is the minimum nu...
• The smallest finite automaton, which accepts the language { x | length of x is divisible by 3} has
• Given the following state table of an FSM with two states A and B, one input and one output: | Present Stat...
• Given the following state table of an FSM with two states A and B, one input and one output: | Present Stat...
• Given below are two finite state automata (→ indicates the start state and F indicates a final state) Y: | ...