1

Consider the regular language L =(111+11111)*. The minimum number of states

Correct Answer: 9

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.

Theory of Computation and Compiler Design MCQ: Consider the regular language L =(111+11111)*. The minimum number of states | Extra Education