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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
We consider a finite-state machine channel with a finite memory length (e.g., finite length intersymbol interference channels… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We give an algorithm that derives a finite state machine (FSM) from a given abstract state machine (ASM) specification. This… (More)
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paper proposes a state based approach to gesture learning and recognition. Using spatial clustering and temporal alignment… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper studies the semantics of hierarchical finite state machines (FMS’s) that are composed using various concurrency models… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Finite state cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The application of the Mutation Analysis criterion in the context of specifiation based on Finite State Machine is proposed. The… (More)
  • figure 4.1
  • figure 4.2
  • table 5.1
  • figure 5.1
  • figure 5.3
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Computer-Aided synthesis of sequential functions of VLSI systems, such as microprocessor control units, must include design… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
A model of commumcations protocols based on finite-state machines is investigated. The problem addressed is how to ensure certain… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1972
Highly Cited
1972
The Nerode realization technique for synthesizing finite-state machines from their associated right-invariant equivalence… (More)
Is this relevant?