Linked from

The 38 pages that link to Finite-state machine, each with the reason it gives.

• Turing machineCompared with: Its limited storage makes it less powerful than a Turing machine.

• Formal languageRelated: A finite-state machine recognizes a language by accepting or rejecting each input string.

• Directed graphRelated: Its states and directed transitions form a graph of possible behavior.

• Computability theoryCompared with: Its restricted memory makes it weaker than the Turing-machine model used for general computability.

• Logic gateRelated: Combinational gates calculate the state transitions in digital controllers.

• Vertex (graph theory)Related: In its graph representation, each state is a vertex and each transition an edge.

• Model checkingNarrower topic: Many model-checking problems reduce system behavior to a finite-state machine.

• RecursionCompared with: Explicit state transitions offer an alternative to representing progress through nested calls.

• Game stateRelated: Game logic often tracks modes such as menus, active play, and completion as states.

• Universal Turing machineCompared with: Unlike a universal Turing machine, it cannot simulate arbitrary Turing machines.

• Digital logicRelated: It provides a systematic way to design controllers as sequential circuits.

• Pushdown automatonNarrower topic: The automaton’s control component is a finite-state machine.

• SemigroupRelated: Input strings induce state transformations whose composition forms a finite semigroup.

• Deterministic finite automatonNarrower topic: The deterministic finite automaton is a finite-state machine with a specific transition rule and acceptance task.

• Transition functionNarrower topic: A transition function is the rule governing its state changes.

• Digital circuitBroader topic: Sequential circuits implement state machines for control and ordered behavior.

• Petri netCompared with: Unlike a basic finite-state machine, a Petri net can represent independent concurrent activity compactly.

• Digital computerRelated: Digital circuits use state and transitions to store history and control behavior.

• String (computer science)Related: A finite-state machine can recognize strings by processing their symbols in sequence.

• Chomsky hierarchyRelated: Finite-state machines characterize the regular languages at the hierarchy’s least powerful level.

• Communication protocolRelated: Many protocols specify which messages are valid in each connection state.

• Digital electronicsBroader topic: Digital controllers use state transitions to produce behavior over time.

• Artificial intelligence in video gamesRelated: Game characters often use states such as patrolling, pursuing, and attacking to organize behavior.

• Automata theoryBroader topic: Finite-state machines are the basic models behind the simplest automata and regular languages.

• Hardware description languageRelated: HDLs express controllers by describing states, transitions, and outputs.

• ParserCompared with: Finite-state machines handle regular patterns, while parsers capture nested grammatical structure.

• State machineBroader topic: It is the standard finite form of the model.

• Computational linguisticsRelated: Finite-state models capture useful patterns in morphology, phonology, and text processing.

• Synchronous circuitRelated: Its state-transition model describes many synchronous control circuits.

• FurbyNarrower topic: Furby's responses depend on its current state as well as sensed events.

• TamagotchiRelated: Care actions and elapsed time change the pet’s condition and behavior.

• Theory of computationBroader topic: It captures a restricted form of computation central to automata theory.

• Logic (digital electronics)Related: Sequential logic implements state transitions in controllers and protocols.

• Model of computationBroader topic: Its limited memory makes it a simple model for recognizing regular patterns.

• Peg solitaireRelated: Each peg arrangement is a state, and each legal jump is a transition.

• State (computing)Broader topic: It represents systems whose relevant configurations can be enumerated.

• State (condition)Broader topic: It represents systems whose conditions fall into a limited number of categories.

• War (card game)Related: A game can be modeled by its card arrangement and whose turn it is.