Skip to search formSkip to main contentSkip to account menu

Finite-state machine

Known as: FSM, Finite state, Finite automata 
The behavior of state machines can be observed in many devices in modern society that perform a predetermined sequence of actions depending on a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Abstract machineAbstract state machinesApplication-specific instruction set processorBehavior model

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
Feature extraction and dimensionality reduction algorithms and their applications in vowel recognition
Highly Cited
2002
Highly Cited
2002
Structure and interpretation of signals and systems
1. Signals and Systems. 2. Defining Signals and Systems. 3. State Machines. 4. Composing State Machines. 5. Linear Systems. 6… 
Highly Cited
2000
Highly Cited
2000
Gesture modeling and recognition using finite state machines
We propose a state-based approach to gesture learning and recognition. Using spatial clustering and temporal alignment, each… 
Highly Cited
1996
Highly Cited
1996
Towards ASR on partially corrupted speech
A new highly parallel approach to automatic recognition of speech, inspired by early Fetcher's research on articulation index… 
Highly Cited
1996
Highly Cited
1996
Interconnected Automata and Linear Systems: A Theoretical Framework in Discrete-Time
This paper summarizes the definitions and several of the main results of an approach to hybrid systems, which combines finite… 
Highly Cited
1995
Highly Cited
1995
A limit study of local memory requirements using value reuse profiles
Modern high-performance microprocessors are devoting more and more resources to the problem of the von Neuman bottleneck. In this… 
Highly Cited
1993
Highly Cited
1993
Synchronous Observers and the Verification of Reactive Systems
Synchronous programming [20, 14] is a useful approach to design reactive systems. A synchronous program is supposed to instantly… 
Highly Cited
1990
Highly Cited
1990
Switching and Finite Automata Theory: Computer Science Series
Highly Cited
1985
Highly Cited
1985
Implementing a cache consistency protocol
We present an ownership-based multiprocessor cache consistency protocol, designed for implementation by a single chip VLSI cache… 
Highly Cited
1985
Highly Cited
1985
The development of an experimental discrete dictation recognizer
This paper describes an experimental real-time recognizer of isolated word dictation implemented at the IBM Thomas J. Watson… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)