Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Finite-state machine
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Usage == In addition to their use in modeling reactive systems presented here, finite-state machines are significant in many different areas, including [[electrical engineering]], [[linguistics]], [[computer science]], [[philosophy]], [[biology]], [[mathematic]]s, [[video game programming]], and [[logic]]. Finite-state machines are a class of automata studied in [[automata theory]] and the [[theory of computation]]. In computer science, finite-state machines are widely used in modeling of application behavior ([[control theory]]), design of [[Digital electronics|hardware digital systems]], [[software engineering]], [[compiler]]s, [[network protocol]]s, and [[computational linguistics]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)