Design a Finite State Automaton (FSA) that accepts binary numbers greater than 0, whose decimal equivalents...

Transcribed Image Text:

Design a Finite State Automaton (FSA) that accepts binary numbers greater than 0, whose decimal equivalents are divisible by 5. For instance, the FSA should accept inputs like '1010' (decimal equivalent: 10), and '101' (decimal equivalent: 5), but it rejects inputs like '1101' (decimal equivalent: 13) and '1001' (decimal equivalent: 9). [4 marks] Design a Finite State Automaton (FSA) that accepts binary numbers greater than 0, whose decimal equivalents are divisible by 5. For instance, the FSA should accept inputs like '1010' (decimal equivalent: 10), and '101' (decimal equivalent: 5), but it rejects inputs like '1101' (decimal equivalent: 13) and '1001' (decimal equivalent: 9). [4 marks]

Answer rating: 100% (QA)

The image contains a question asking to design a Finite State Automaton FSA that accepts binary numbers greater than 0 whose decimal equivalents are divisible by 5 For instance the FSA should accept i... View the full answer