Theory of Computation MCQ: Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:

Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:

Correct Answer: 9

Make the most of this question

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

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

WhatsApp+91 99922 70404Theory of Computation MCQ: Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is: | Extra Education