Test 3 - Theory of Computation | Computer Science

Time: 00:00:00

0

Attempted

22

Not Attempted

0

Marked For Review

0

Attempted & Reviewed

Question 1 of 22

The smallest finite automaton, which accepts the language { x | length of x is divisible by 3} has

Select Your Answer:

2 states

3 states

4 states

5 states

Mark for Review

All Questions

Attempted

Not Attempted

Marked for Review

Attempted & Reviewed

Current