Information for "Finite-state machine"

From HandWiki

Basic information

Display titleFinite-state machine
Default sort keyFinite-state machine
Page length (in bytes)42,137
Namespace ID0
Page ID217453
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Page imageAutomata theory.svg
HandWiki item IDNone

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>John Stpola
Date of page creation19:40, 6 February 2024
Latest editorimported>John Stpola
Date of latest edit19:40, 6 February 2024
Total number of edits1
Recent number of edits (within past 90 days)0
Recent number of distinct authors0

Page properties

Hidden categories (2)

This page is a member of 2 hidden categories:

Transcluded templates (63)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
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...
Information from Extension:WikiSEO