1. Engineering
  2. Computer Science
  3. please explain your solution give a state diagram of a...

Question: please explain your solution give a state diagram of a...

Question details

Please explain your solution.

Give a state diagram of a DFA recognizing the following language.

(a) {w | w contains 0...9}, The alphabet is Σ={0,... ,9}

(b) {w | w is the string ';'}, The alphabet is Σ={;}

(c) {w | w is the string '&&'}, The alphabet is Σ= {&}

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution