Please draw a finite state machine (finite automate) that accepts any binary number that is divisible by 3. The only characters in the language are 0 and 1.
Added by Aitor R.
Step 1
The remainders can be 0, 1, or 2. Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 59 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Construct a finite-state machine that gives an output of 1 if the number of input symbols read so far is divisible by 3 and an output of 0 otherwise.
Sri K.
Construct a deterministic finite-state automaton that recognizes the set of all bit strings that contain exactly three 0 $\mathrm{s}$ .
Modeling Computation
Finite-State Machines with No Output
Construct a deterministic finite-state automaton that recognizes the set of all bit strings that contain an even number of 0 $\mathrm{s}$ and an odd number of 1 $\mathrm{s}$ .
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD