Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
The computational power of networks of small resource-limited mobile agents is explored. Two new models of computation based on… Expand
  • figure 1
Highly Cited
2004
Highly Cited
2004
Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite… Expand
Highly Cited
2000
Highly Cited
2000
We propose a state-based approach to gesture learning and recognition. Using spatial clustering and temporal alignment, each… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
1998
Review
1998
Multilayer neural networks trained with the back-propagation algorithm constitute the best example of a successful gradient based… Expand
  • figure 17
  • figure 21
  • figure 24
  • figure 26
  • figure 27
Highly Cited
1994
Highly Cited
1994
We study the complexity of two fundamental problems in the testing of finite-state machines. 1) Distinguishing sequences (state… Expand
Highly Cited
1990
Highly Cited
1990
  • J. Elman
  • Cogn. Sci.
  • 1990
  • Corpus ID: 2763403
Time underlies many interesting human behaviors. Thus, the question of how to represent time in connectionist models is very… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Highly Cited
1978
Highly Cited
1978
  • T. S. Chow
  • IEEE Transactions on Software Engineering
  • 1978
  • Corpus ID: 14266481
We propose a method of testing the correctness of control structures that can be modeled by a finite-state machine. Test results… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Highly Cited
1972
Highly Cited
1972
The Nerode realization technique for synthesizing finite-state machines from their associated right-invariant equivalence… Expand