Concept

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. Finite-state machines are of two types—deterministic finite-state machines and non-deterministic finite-state machines. A deterministic finite-state machine can be constructed equivalent to any non-deterministic one. The behavior of state machines can be observed in many devices in modern society that perform a predetermined sequence of actions depending on a sequence of events with which they are presented. Simple examples are: vending machines, which dispense products when the proper combination of coins is deposited; elevators, whose sequence of stops is determined by the floors requested by riders; traffic lights, which change sequence when cars are waiting; combination locks, which require the input of a sequence of numbers in the proper order. The finite-state machine has less computational power than some other models of computation such as the Turing machine. The computational power distinction means there are computational tasks that a Turing machine can do but an FSM cannot. This is because an FSM's memory is limited by the number of states it has. A finite-state machine has the same computational power as a Turing machine that is restricted such that its head may only perform "read" operations, and always has to move from left to right. FSMs are studied in the more general field of automata theory. An example of a simple mechanism that can be modeled by a state machine is a turnstile. A turnstile, used to control access to subways and amusement park rides, is a gate with three rotating arms at waist height, one across the entryway.

Official source

https://en.wikipedia.org/wiki/Finite-state_machine

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related courses (32)

MATH-502: Distribution and interpolation spaces

The goal of this course is to give an introduction to the theory of distributions and cover the fundamental results of Sobolev spaces including fractional spaces that appear in the interpolation theory. Those notions are central to the study of partial dif ...

MATH-410: Riemann surfaces

This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex domains under discontinuous group actions, as algebraic ...

EE-207: Logic systems (for EL)

Ce cours couvre les fondements des systèmes numériques. Sur la base d'algèbre Booléenne et de circuits combinatoires et séquentiels incluant les machines d'états finis, les methodes d'analyse et de synthèse de système logiques sont étudiées et appliquées. ...

Related units (8)

IGM - Administration

Distributed Computing Laboratory

Integrated Systems Laboratory (IC/STI)

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Official source

https://en.wikipedia.org/wiki/Finite-state_machine

About this result

Related courses (32)

MATH-502: Distribution and interpolation spaces

MATH-410: Riemann surfaces

EE-207: Logic systems (for EL)

Related lectures (32)

Theoreus Chain Role: Lipschitz Sit

Covers the Theoreus Chain Role for Lipschitz functions and its practical applications.

Software Disasters and Successes: Verification Impact and Transition Systems

Explores software verification impact, disasters, successes, and transition systems.

LabVIEW Design Patterns

Explores LabVIEW design patterns including local variables, race conditions, state machines, and queues.

Related publications (30)

On blow-up trees for the harmonic map heat flow from $B^2$ to $S^2$

We consider finite-time and k -equivariant solutions to the harmonic map heat flow from

B^2

S^2

under general time-dependent boundary data and prove that the bubble tree decomposition contains only one bubble. The method relies on the Maximum and Comparison Principle. We also exhibit solutions blowing up in infinite time for any

k \ge 1

Springer Science and Business Media LLC2026

A minimal mass blow-up solution on a nonlinear quantum star graph

We construct a finite-time blow-up solution to the mass-critical focusing nonlinear Schrödinger equation on a metric star graph with an arbitrary number of edges. We show that all solutions are global if their mass is smaller than an explicit constant, called “minimal mass”. We then construct a solution with minimal mass and arbitrary energy, which blows up in finite time at the vertex of the star graph. The blow-up profile and blow-up speed are explicitly characterized. The main novelty of the paper is the

2026

Blow up dynamics for the 3D energy-critical nonlinear Schrödinger equation

We construct a two-parameter continuum of type II blow up solutions for the energy-critical nonlinear Schrödinger equation in dimension

d = 3

. The solutions collapse to a single energy bubble in finite time and have the form

\begin{aligned} u(t,x) = e^{i \alpha (t)}\lambda (t)^{\frac{1}{2}}W(\lambda (t) x) + \eta (t, x ),~ ~ t \in [0, T),~ x \in {{\,\mathrm{\mathbb {R}}\,}}^3, \end{aligned}

u ( t , x ) = e i α ( t ) λ ( t ) 1 2 W ( λ ( t ) x ) + η ( t , x ) , t ∈ [ 0 , T ) , x ∈ R 3 , where $ W( x) =

Springer Science and Business Media LLC2026

Related people (32)

Auke Ijspeert

Auke Ijspeert is a full professor at the EPFL, and head of the Biorobotics Laboratory (BioRob). He has a B.Sc./M.Sc. in physics from the EPFL (1995), and a PhD in artificial intelligence from the University of Edinburgh (1999). He carried out postdocs at IDSIA and EPFL, and at the University of Southern California (USC). He then became a research assistant professor at USC, and an external collaborator at ATR (Advanced Telecommunications Research institute) in Japan. In 2002, he came back to the EPFL as an SNF assistant professor. He was promoted to associate professor in October 2009 and to full professor in April 2016. His primary affiliation is with the Institute of Bioengineering, and secondary affiliation with the Institute of Mechanical Engineering. His research interests are at the intersection between robotics, computational neuroscience, nonlinear dynamical systems, and machine learning. He is interested in using numerical simulations and robots to get a better understanding of sensorimotor coordination in animals, and in using inspiration from biology to design novel types of robots and adaptive controllers. (see for instance Ijspeert et al Science 2007, Ijspeert Science 2014, and Nyakatura et al Nature 2019). He is also investigating how to assist people with limited mobility using exoskeletons and assistive furniture. He is regularly invited to give talks on these topics (e.g. TED talk given at TED Global Geneva, Dec 8 2015). With his colleagues, he has received paper awards at ICRA2002, CLAWAR2005, IEEE Humanoids 2007, IEEE ROMAN 2014, CLAWAR 2015, SAB2018, and CLAWAR 2019. He is an IEEE Fellow, member of the Board of Reviewing Editors of Science magazine, and associate editor for the IEEE Transactions on Medical Robotics and Bionics and for the International Journal of Humanoid Robotics. He has acted as an associate editor for the IEEE Transactions on Robotics (2009-2013) and for Soft Robotics (2018-2021). He was a guest editor for the Proceedings of IEEE, IEEE Transactions on Biomedical Engineering, Autonomous Robots, IEEE Robotics and Automation Magazine, and Biological Cybernetics. He has been the organizer of 7 international conferences (BioADIT2004, SAB2004, AMAM2005, BioADIT2006, LATSIS2006, SSRR2016, AMAM2019), and a program committee member of over 50 conferences.

Rüdiger Urbanke

Rüdiger L. Urbanke obtained his Dipl. Ing. degree from the Vienna University of Technology, Austria in 1990 and the M.Sc. and PhD degrees in Electrical Engineering from Washington University in St. Louis, MO, in 1992 and 1995, respectively. He held a position at the Mathematics of Communications Department at Bell Labs from 1995 till 1999 before becoming a faculty member at the School of Computer & Communication Sciences (I&C) of EPFL. He is a member of the Information Processing Group. He is principally interested in the analysis and design of iterative coding schemes, which allow reliable transmission close to theoretical limits at low complexities. Such schemes are part of most modern communications standards, including wireless transmission, optical communication and hard disk storage. More broadly, his research focuses on the analysis of graphical models and the application of methods from statistical physics to problems in communications. From 2000-2004 he was an Associate Editor of the IEEE Transactions on Information Theory and he is currently on the board of the series "Foundations and Trends in Communications and Information Theory." In 2017 he was President of the Information Theory Society. From 2009 till 2012 he was the head of the I&C doctoral school, in 2013 he served as Dean a. i. of I&C, and since 2016 he is the Associated Dean for teaching of I&C. He is a co-author of the book "Modern Coding Theory" published by Cambridge University Press. Awards: 2021 IEEE Information Theory Society Paper Award 2016 STOC Best Paper Award 2014 La Polysphere Teaching Award 2014 IEEE Hamming Medal 2013 IEEE Information Theory Society Paper Award 2011 MASCO Best Paper Award 2011 IEEE Koji Kobayashi Award 2009 La Polysphere Teaching Award 2002 IEEE Information Theory Society Paper Award Fulbright Scholarship My students have won the following awards: M. Mondelli, 2021 IEEE Information Theory Paper Award M. Mondelli, EPFL Doctorate Award 2018 M. Mondelli, Patrick Denantes Award, 2017 M. Mondelli, IEEE IT Society Student Paper Award at ISIT, 2015 M. Mondelli, Dan David Prize Scholarship, 2015 H. Hassani, Inaugural Thomas Cover Dissertation Award, 2014 S. Kudekar, 2013 & 2021 IEEE Information Theory Paper Award A. Karbasi, Patrick Denantes Award, 2013 V. Venkatesan, Best Paper Award at MASCOTS, 2011 A. Karbasi, Best Student Paper Award at ICASSP, 2011 (with R. Parhizkar) A. Karbasi, Best Student Paper Award at ACM SIGMETRICS, 2010 (with S. Oh) S. Korada, ABB Dissertation Award, 2010 S. Korada, IEEE IT Society Student Paper Award at ISIT, 2009 (with E. Sasoglu) S. Korada, IEEE IT Society Student Paper Award at ISIT, 2008

Stefano Francesco Burzio

Expertise Analysis and modeling of nonlinear phenomena occurring in mathematical physics. Hyperbolic partial differential equations. Finite element method. Education Mathematics | Mathematics 2015 – 2020 EPFL Directed by Joachim Krieger MAS / Diplôme d'enseignement pour le degré secondaire 2 | Pedagogy 2019 – 2020 HEP Vaud Master of Science | Mathematics 2011 – 2014 University of Turin Directed by Susanna

Arnaud Vincent Klipfel

Sara Messara

Pierre Lavanchy

Formation Electronique et mécanique de base | Atelier d'électronique et mécanique en parallèle de cours théoriques 1982 – 1984 Ecole Technique et des Métiers de Lausanne ETML Dirigée par Electronique, mécanique Electronique industrielle | Diplôme d’ingénieur ETS en électronique 1985 – 1987 EINEV Ecole d’Ingénieurs de l’Etat de Vaud (Yverdon, Suisse) Dirigée par Cours et laboratoires en électronique

Ugo Siravo

Teaching & PhD Courses Fusion and industrial plasma technologies PHYS-632 The course provides an overview of the technologies that are essential for fusion developments and for industrial plasmaapplications, highlighting the synergies between the two fields. The aim is to provide a combined theoretical andexperimental background to the various topics.

Duccio Testa

Professionals experiences Supply teacher of mathematics, physics and computing 1994–1995 various high schools in Torino (Italy) Teaching & PhD Past EPFL PhD Students as codirector Theodoros Panis, Lorenzo Stipani Courses Sustainable energy innovation HUM-292 This course provides an introduction to the technical, social, and economic fundamentals of energy. The course examines the concrete case of nuclear fusion. How could this energy reshape our world? How can we ensure its acceptability, st

Frédéric Dolizy

Edouard Bugnion

Edouard Bugnion joined EPFL in 2012, where his focus is on datacenter systems. His areas of interest include operating systems, datacenter infrastructure (systems and networking), and computer architecture. Before joining EPFL, Edouard spent 18 years in the US, where he studied at Stanford and co-founded two startups: VMware and Nuova Systems (acquired by Cisco). At VMware from 1998 until 2005, he played many roles including CTO. At Nuova/Cisco from 2005 until 2011, he helped build the core engineering team and became the VP/CTO of Ciscos Server, Access, and Virtualization Technology Group, a group that brought to market Ciscos Unified Computing System (UCS) platform for virtualized datacenters. Prof. Bugnion is a Fellow of the ACM. Together with his colleagues, he received the ACM Software System Award for VMware 1.0 in 2009. His paper Disco: Running Commodity Operating Systems on Scalable Multiprocessors" received a Best Paper Award at SOSP '97 and was entered into the ACM SIGOPS Hall of Fame Award in 2008. At EPFL, he received the OSDI 2014 Best Paper Award for his work on the IX dataplane operating system

Related units (8)

IGM - Administration

Distributed Computing Laboratory

Integrated Systems Laboratory (IC/STI)

Related concepts (13)

Automata theory

Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science. The word automata comes from the Greek word αὐτόματος, which means "self-acting, self-willed, self-moving". An automaton (automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a Finite Automaton (FA) or Finite-State Machine (FSM).

Deterministic finite automaton

In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA)—also known as deterministic finite acceptor (DFA), deterministic finite-state machine (DFSM), or deterministic finite-state automaton (DFSA)—is a finite-state machine that accepts or rejects a given string of symbols, by running through a state sequence uniquely determined by the string. Deterministic refers to the uniqueness of the computation run.

Regular language

In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science (as opposed to many modern regular expression engines, which are augmented with features that allow the recognition of non-regular languages). Alternatively, a regular language can be defined as a language recognized by a finite automaton.

Related exercises (4)

Excitation of a vertical harmonic oscillator

A mass m is suspended on a spring of natural length l₀ and of elastic constant k. The spring is attached to a piston. The vertical motion of the piston is described by the equation s(t)u2004=u2004s₀cosu2006(ωt)xa0.

Give explicit expressions for the external forces and determine the equation of motion.
Show that the equation of motion can be recast as, $\ddot{x}\left(t\right) + c_1\,x\left(t\right) = c_1\,s\left(t\right)\ ,$ where x(t)u2004=u2004z(t)u2005+u2005c₂ with z(t) the vertica

Model of elastic collision

A chariot considered as a material point of mass m moves without friction on an horizontal plane; a spring of constant k is mounted at one end of the chariot. Through this spring, the chariot that has a speed v₀, collides with a fixed wall (considered as having an infinite mass); the spring first contracts, then expands, and the chariot moves in the opposite direction. We assume that the collision is perfectly elastic, i.e. the mechanical energy is conserved.

Determine the time interval Δt during which

Study of density function

Consider the volume density of charge ρ(x,y,z)u2004=u2004ρ(x) of the figure on the left, infinite in the directions y and z, where: aρ₀₊u2004=u2004Au2006[Cu2006m⁻²]. a) Determine and graphically represent the electric field associated for all of the values of x. Determine and graphically represent the potential V(x), with the condition V(−a/2)u2004=u20040. b) Now consider the charge density ρ(x,y,z)u2004=u2004ρ(x) of the figure on the right side, where bρ⁰⁻u2004=u2004aρ₀₊u2004=u2004A. Determine and graphi

Related notebooks (3)

Implementation and Analysis of FIR Filters

Digital filters are fully described by their constant-coefficient difference equation (CCDE) and a CCDE can be easily translated into a few lines of code to obtain a simple filter implementation. In the case of FIR filters the coefficients in the CCDE coincide with the values of the impulse response, so that FIR filters can also be implemented as a convolution (aka an inner product) or by performing a multiplication in the frequency domain, as we will see shortly. When applying an FIR filter to a finite-l

Exploring Chemical Potential for Fermions in 3D at Finite Temperature

This notebook gives a simple illustration to the variation of chemical potential for Fermions in 3D, following the Fermi-Dirac statistics in finite temperature. " In 3D, we have the density of states

\\rho \\propto \\sqrt{E}

. At zero temperature, the distribution of electrons just follows

g(E)=a \\sqrt{E}

and the Fermi energy is determined by the total occupied number

N_{occ}

E_f

is the energy such that

N_{occ}=\\int_{0}^{E_f} g(E) dE

\n", " \n", "In finite temperature, however, o

Exploring the Karplus-Strong Algorithm for Sound Synthesis

The Karplus-Strong Algorithm[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

The Karplus-Strong algorithm is a simple method to generate synthetic sounds with arbitrary pitch. In this notebook we will explore a few variations of the method to illustrate some basic notions of discrete-time signal processing. In [1]: %matplotlib inline import matplotlib import matplotlib.pyplot as plt import numpy as np import IPython In [2]: plt.rcParams["figure.figsize"]

Related publications (30)

On blow-up trees for the harmonic map heat flow from $B^2$ to $S^2$

We consider finite-time and k -equivariant solutions to the harmonic map heat flow from

B^2

S^2

k \ge 1

Springer Science and Business Media LLC2026

A minimal mass blow-up solution on a nonlinear quantum star graph

2026

Blow up dynamics for the 3D energy-critical nonlinear Schrödinger equation

We construct a two-parameter continuum of type II blow up solutions for the energy-critical nonlinear Schrödinger equation in dimension

d = 3

. The solutions collapse to a single energy bubble in finite time and have the form

\begin{aligned} u(t,x) = e^{i \alpha (t)}\lambda (t)^{\frac{1}{2}}W(\lambda (t) x) + \eta (t, x ),~ ~ t \in [0, T),~ x \in {{\,\mathrm{\mathbb {R}}\,}}^3, \end{aligned}

u ( t , x ) = e i α ( t ) λ ( t ) 1 2 W ( λ ( t ) x ) + η ( t , x ) , t ∈ [ 0 , T ) , x ∈ R 3 , where $ W( x) =

Springer Science and Business Media LLC2026

Related people (32)

Auke Ijspeert

Rüdiger Urbanke

Stefano Francesco Burzio

Arnaud Vincent Klipfel

Related exercises (4)

Excitation of a vertical harmonic oscillator

Give explicit expressions for the external forces and determine the equation of motion.
Show that the equation of motion can be recast as, $\ddot{x}\left(t\right) + c_1\,x\left(t\right) = c_1\,s\left(t\right)\ ,$ where x(t)u2004=u2004z(t)u2005+u2005c₂ with z(t) the vertica

Model of elastic collision

Determine the time interval Δt during which

Study of density function

Related notebooks (3)

Implementation and Analysis of FIR Filters

Exploring Chemical Potential for Fermions in 3D at Finite Temperature

This notebook gives a simple illustration to the variation of chemical potential for Fermions in 3D, following the Fermi-Dirac statistics in finite temperature. " In 3D, we have the density of states

\\rho \\propto \\sqrt{E}

. At zero temperature, the distribution of electrons just follows

g(E)=a \\sqrt{E}

and the Fermi energy is determined by the total occupied number

N_{occ}

E_f

is the energy such that

N_{occ}=\\int_{0}^{E_f} g(E) dE

\n", " \n", "In finite temperature, however, o

Exploring the Karplus-Strong Algorithm for Sound Synthesis

The Karplus-Strong Algorithm[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL