two circles are connected to each other with numbers on them
Save
brilliant.org

Finite State Machines | Brilliant Math & Science Wiki

A finite state machine (sometimes called a finite state automaton) is a computation model that can be implemented with hardware or software and can be used to simulate sequential logic and some computer programs. Finite state automata generate regular languages. Finite state machines can be used to model problems in many fields including mathematics, artificial intelligence, games, and linguistics. There are two types of finite state machines (FSMs): deterministic finite state machines…

Comments

No comments yet! Add one to start the conversation.