Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

State Machine Principle

Description

This lecture introduces the concept of a state machine through practical challenges, where pressing different buttons triggers specific actions, emphasizing the importance of defining clear instructions for the robot to follow.

In MOOC

The Thymio robot as a tool for discovering digital science

Official source

Related concepts (10)

Finite-state machine

A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to another in response to some inputs; 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 inputs that trigger each transition.

Mealy machine

In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs. This is in contrast to a Moore machine, whose output values are determined solely by its current state. A Mealy machine is a deterministic finite-state transducer: for each state and input, at most one transition is possible. The Mealy machine is named after George H. Mealy, who presented the concept in a 1955 paper, "A Method for Synthesizing Sequential Circuits".

Moore machine

In the theory of computation, a Moore machine is a finite-state machine whose current output values are determined only by its current state. This is in contrast to a Mealy machine, whose output values are determined both by its current state and by the values of its inputs. Like other finite state machines, in Moore machines, the input typically influences the next state. Thus the input may indirectly influence subsequent outputs, but not the current or immediate output. The Moore machine is named after Edward F.

State diagram

A state diagram is a type of diagram used in computer science and related fields to describe the behavior of systems. State diagrams require that the system described is composed of a finite number of states; sometimes, this is indeed the case, while at other times this is a reasonable abstraction. Many forms of state diagrams exist, which differ slightly and have different semantics. State diagrams are used to give an abstract description of the behavior of a system.

Turing machine

A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, it is capable of implementing any computer algorithm. The machine operates on an infinite memory tape divided into discrete cells, each of which can hold a single symbol drawn from a finite set of symbols called the alphabet of the machine. It has a "head" that, at any point in the machine's operation, is positioned over one of these cells, and a "state" selected from a finite set of states.

Related lectures (31)

Understanding State Machines MOOC: The Thymio robot as a tool for discovering digital science

Explores the concept of state machines through controlling a robot.

Theoretical Properties of RNNs

Explores the theoretical properties and practical power of Recurrent Neural Networks, including their relationship to state machines and Turing completeness.

Understanding State Machine Concept MOOC: The Thymio robot as a tool for discovering digital science

Explores the concept of a state machine using interactive robot programming exercises.

Sequential Systems: Microcontrollers

Explores sequential systems, state machines, microcontroller solutions, logical systems, and practical applications in real-world projects.

Introducing Advanced Computing Concepts with VPL MOOC: The Thymio robot as a tool for discovering digital science