A minimum state deterministic finite automaton accepting the language L = {w | w $\in${0, 1}*, number of 0s and 1s in w are divisible by 3 and 5, respectively} has
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- The smallest finite automaton, which accepts the language { x | length of x is divisible by 3} has
- 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...
- Consider the following Finite State Automaton:  The minimum state autom...
- Consider the following Finite State Automaton:  The minimum state autom...
- Consider the regular language L = (111 + 11111) *. The minimum number of states in any DFA accepting these ...
- Consider the regular language L = (111 + 11111) *. The minimum number of states in any DFA accepting these ...
- Given an arbitary non-deterministic finite automaton (NFA) with N states, the maximum number of states in a...
- Consider the following deterministic finite state automaton M. ![GATE 2003][1] Let S denote the set of seve...