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

Keep practicing — related questions

• Consider a DFA over $\sum$= {a,b} accepting all strings which have number of a's divisible by 6 and number ...
• Let w be any string of length n in {0, 1}*. Let L be the set of all substrings of w. What is the minimum nu...
• Definition of a language $L$ with alphabet $\{a\}$ is given as following. $$ L = \left\\{a^{nk} \mid k > 0,...
• A minimum state deterministic finite automaton accepting the language L = {w | w $\in${0, 1}*, number of 0s...
• A minimum state deterministic finite automaton accepting the language L = {w | w $\in${0, 1}*, number of 0s...
• The smallest finite automaton, which accepts the language { x | length of x is divisible by 3} has
• Consider the following Finite State Automaton:  The minimum state autom...
• Consider the following Finite State Automaton:  The minimum state autom...