Finite State Automata

We learned last week that we can draw/design/simulate computer programs and sequential logic circuits using FSM. The design is defined by a list of its states. We also learned that when you draw the FSM it starts at one point “current state” which can change to another state when initiated by a certain condition. Hence, Finite-State-Automata shows one state at a time.

In the example above, we can say if the starting state is q0 if we get z1 as input, then the state will change to q1. Or if the input is z0, then state will change to q3. If we’re on q1 and considered z1 as input then will keep the same state, or if input z0 then state will change to q2 and so on:

Current State                     Input                     Final State

q0                                           z1                            q1

q0                                           z0                            q3

q1                                           z1                            q1

q1                                           z0                            q2

q2                                           z1                            q3

q2                                           z0                            q0

q3                                           z1                            q0

q3                                           z0                            q3

                So far, I find the subject understandable and interesting  which will help me in my programming career. I still need to review the new definitions of "alphabet, string, and language" since they are new to me and would need to familiarize myself more with them.