- +1-530-264-8006
- info@tutorsglobe.com

18,76,764

Questions

Asked

21,311

Experts

9,67,568

Questions

Answered

Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!

Submit Assignment
## Simple Finite State Machines, Finite State Machines

Simple finite state machines:Simple finite state machines encountered in the light switches, ticket vending machines, wrist watches, computer user interfaces and so on.

Shift register: It save the last 3 bits of the data stream:

Counter mod m with reset (example: clock):

Serial binary adder:

FSMs are the standard system components for executing arithmetic numbers of fixed size, state 32 bits; however they can’t do much more than addition and subtraction on numbers of random size.

Exercise: Illustrate that there is no fsm multiplier for the numbers of random size.

Mod 3 divider: Read a binary integer ‘left to right’, that is most significant bit first, and calculate its remainder mod 3.

Explanation: Let consider an integer with the binary representation L b, where L is the bit string and b is a single bit.

Let |L| represent the integer symbolized by L, and likewise for |L b|. Suppose L has been read, most noteworthy bit first, and, by way of illustration, the fsm is now in state ‘≡1’, signifying that |L| mod 3 = 1. Then L 0 symbolizes the integer |L 0| = 2 |L|, where |L 0| mod 3 = 2; and L 1 symbolizes |L 1| = 2 |L| + 1, where |L 1| mod 3 = 0. This validates the two transitions out of state ‘≡1’. We can turn this fsm to an acceptor by designating certain state(s) as accepting, and therefore recognizing any language that is a union of residue classes mod 3. Example: L0 = {x | |x| mod 3 = 0}, or L12 = {x | |x| mod 3 ≠ 0}, where |x| is an integer represented by x.

Latest technology based Theory of Computation Online Tutoring AssistanceTutors, at the

www.tutorsglobe.com, take pledge to provide full satisfaction and assurance inTheory of Computation helpviaonline tutoring. Students are getting 100% satisfaction byonline tutorsacross the globe. Here you can get homework help for Theory of Computation, project ideas and tutorials. We provide email basedTheory of Computation help. You can join us to ask queries 24x7 with live, experienced and qualified online tutors specialized in Theory of Computation. ThroughOnline Tutoring, you would be able to complete your homework or assignments at your home. Tutors at theTutorsGlobeare committed to provide the best qualityonline tutoringassistance forTheory of Computation Homework helpandassignment helpservices. They use their experience, as they have solved thousands of the Theory of Computation assignments, which may help you to solve your complex issues of Theory of Computation.TutorsGlobeassure for the best quality compliance to your homework. Compromise with quality is not in our dictionary. If we feel that we are not able to provide thehomework helpas per the deadline or given instruction by the student, we refund the money of the student without any delay.