Digital electronicsLesson 2 of 2 in the course Sequential logic
Finite-State Machines: Models, Outputs, and Applications
5 flashcards · 5 quiz questions · 5 match pairs · 5 fill-in sentences · English
Lesson progress
0 / 5
Your progress is kept in this browser only.Sign up to save it
Summary
A finite-state machine (FSM) models a system that can occupy one of a limited number of states and change state in response to inputs. FSMs help explain systems that react to events in predictable ways.
A finite-state machine, also called a finite-state automaton, is an abstract model that has exactly one current state at a time from a finite set of possible states. An input may cause the machine to move to another state. This change is called a transition.
All flashcards
Quiz questions
Based on the Wikipedia article Finite-state machine, licensed CC BY-SA 4.0. Adapted into a summary, flashcards and quizzes.
More in Digital electronics
All Digital electronics lessonsDigital electronicsSequential Logic: Synchronous Timing and Asynchronous Design5 flashcards · 5 quiz questions · 4 gamesPlay free →Digital electronicsVHDL: Design Modeling, Simulation, and Synthesis5 flashcards · 5 quiz questions · 4 gamesPlay free →Digital electronicsLogic Gates: Boolean Functions, Memory, and Physical Implementation5 flashcards · 5 quiz questions · 4 gamesPlay free →