1. Engineering
  2. Computer Science
  3. i need help with just exercise 11 i cant...

Question: i need help with just exercise 11 i cant...

Question details

I need help with just exercise 11 - I can't figure out the proof by induction for this

EXERCISE 10 Draw a DFA that accepts the language of strings that are binary representations of numbers that are divisible by 5. EXERCISE 11 Prove that your DFA from Exercise 10 accepts the language it is supposed induction on the length of the input string. o accept. Use

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