A finite-state machine is a mathematical model of computation that can be in one of a finite number of states at any given time. It changes from one state to another in response to inputs, and can be either deterministic or non-deterministic. It has less computational power than the Turing machine, but is used in many everyday devices such as vending machines, elevators, traffic lights, and combination locks.

University of Washington

Autumn 2021

CSE 311 introduces theoretical computer science, the theory background necessary for other CSE courses, and how to construct rigorous, formal arguments. Topics include logic, set theory, modular arithmetic, induction, regular expression, and relations.

No concepts data

+ 33 more concepts