Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Finite State Machine

Handbook of Research on Computational Arts and Creative Informatics
A model for the construction of computer programs that defines solutions using a discrete set that may be reduced to a finite set of configurations.
Published in Chapter:
The Philosophies of Software
Lindsay Grace (University of Illinois and Illinois Institute of Art, USA)
DOI: 10.4018/978-1-60566-352-4.ch019
Abstract
Software is philosophical. Software is designed by people who have been influenced by a specific understanding of the way objects, people and systems work. These concepts are then transferred to the user, who manipulates that software within the parameters set by the software designer. The use of these rules by the designer reinforces an understanding of the world that is supported by the software they use. The designer then produces works that mimic these same philosophies instead of departing from them. The three axes of these philosophies are analogy, reductivism, and transferred agency. The effects on computer-based artistic expression, the training in digital art production, and the critique of art are evaluated in this chapter. Tensions between the dominant scientific approaches and the dominant artistic approaches are also defined as destructive and constructive practice respectively. The conclusion is a new critical perspective through which one may evaluate computer integrated creative practice and inspire fresh creative composition.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Bayesian Agent Adaptation in Complex Dynamic Systems
A finite state machine has a set of internal states, and rules for movement between internal states. When describing the behavior of an intelligent agent, internal states prescribe actions, and movement between states is conditioned on observations from the environment.
Full Text Chapter Download: US $37.50 Add to Cart
Hybrid Dynamic Modelling and Bioinspired Control Based on Central Pattern Generator of Biped Robotic Gait
Graphical description of a reactive system, in which the system makes a transition from one state to another, if the condition defining the change is true.
Full Text Chapter Download: US $37.50 Add to Cart
A Hardware Immune System for MC8051 IP Core
A model of computation consisting of a set of states, a start state, an input alphabet, and a transition function that maps input symbols and current states to a next state. Computation begins in the start state with an input string. It changes to new states depending on the transition function. There are many variants, for instance, machines having actions (outputs) associated with transitions (Mealy machine) or states (Moore machine), etc. (http://www.nist.gov/dads/HTML/finiteStateMachine.html). A finite state machine can be used both as a development tool for solving problems and as a formal way of describing specific device or program interactions.
Full Text Chapter Download: US $37.50 Add to Cart
Utilizing Adaptive and Intelligent Systems for Collaborative Online Learning
A Finite State Machine (FSM) is a model of behavior using states and state transitions. A transition is a state change triggered by an input event, i.e. transitions map some state-event pairs to other states. As indicated in the name, the set of states should be finite.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR