Theory of Computation and Compiler Design MCQ: A minimum state deterministic finite automation accepting the language L = {W |W € {0,1}* , number of 0's and 1's in W are divisible by 3 and 5 respectively has

← All Theory of Computation and Compiler Design questions

A minimum state deterministic finite automation accepting the language L = {W |W € {0,1}* , number of 0's and 1's in W are divisible by 3 and 5 respectively has

Correct Answer: 15 States

Make the most of this question

This page focuses on one Theory of Computation and Compiler Design question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Theory of Computation and Compiler Design MCQs All Engineering topics Mock test hub