• Unit 9: Finite-State Automata

    A finite-state machine (FSM) is a mathematical model of computation that describes an abstract machine in one of a finite number of states at any point in time. The FSM can change from one state to another as it responds to data inputs, or when some condition is satisfied. The change from one state to another is called a transition. An FSM is defined by a list of its states, its initial state, and the conditions for each transition. Often, state machines are illustrated as graphs whose nodes are the states and whose links are the transition conditions.

    Completing this unit should take you approximately 2 hours.

    • 9.1: Introduction

    • 9.2: State Transition Diagrams

    • 9.3: Finite-State Machine States

    • 9.4: Putting the Basics to Use

    • Unit 9 Assessment

      • Receive a grade