GATE 2002
March 19, 2025GATE 2002
March 19, 2025GATE 2002
|
Question 38
|
The smallest finite automaton which accepts the language {x|length of x is divisible by 3} has
|
2 states
|
|
|
3 states
|
|
|
4 states
|
|
|
5 states
|
Question 38 Explanation:
{x | length of x divisible by 3} for this constructing a finite Automata that implies
Minimum no. of states that we require is “3”.
Minimum no. of states that we require is “3”.
Correct Answer: B
Question 38 Explanation:
{x | length of x divisible by 3} for this constructing a finite Automata that implies
Minimum no. of states that we require is “3”.
Minimum no. of states that we require is “3”.