Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,276,241 papers from all fields of science
Search
Sign In
Create Free Account
Finite-state machine
Known as:
FSM
, Finite state
, Finite automata
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Abstract machine
Abstract state machines
Application-specific instruction set processor
Behavior model
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The Kaldi Speech Recognition Toolkit
Daniel Povey
,
Arnab Ghoshal
,
+10 authors
Karel Veselý
2011
Corpus ID: 1774023
We describe the design of Kaldi, a free, open-source toolkit for speech recognition research. Kaldi provides a speech recognition…
Expand
Highly Cited
2004
Highly Cited
2004
Computation in networks of passively mobile finite-state sensors
D. Angluin
,
J. Aspnes
,
Zoë Diamadi
,
M. Fischer
,
R. Peralta
ACM SIGACT-SIGOPS Symposium on Principles of…
2004
Corpus ID: 2802601
The computational power of networks of small resource-limited mobile agents is explored. Two new models of computation based on…
Expand
Highly Cited
2004
Highly Cited
2004
Finite state machines for strings over infinite alphabets
F. Neven
,
T. Schwentick
,
V. Vianu
TOCL
2004
Corpus ID: 14338241
Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite…
Expand
Review
1998
Review
1998
Gradient-based learning applied to document recognition
Yann LeCun
,
L. Bottou
,
Yoshua Bengio
,
P. Haffner
Proceedings of the IEEE
1998
Corpus ID: 14542261
Multilayer neural networks trained with the back-propagation algorithm constitute the best example of a successful gradient based…
Expand
Highly Cited
1994
Highly Cited
1994
A Theory of Timed Automata
R. Alur
,
D. Dill
Theoretical Computer Science
1994
Corpus ID: 18129339
Highly Cited
1990
Highly Cited
1990
Finding Structure in Time
J. Elman
Cognitive Sciences
1990
Corpus ID: 2763403
Time underlies many interesting human behaviors. Thus, the question of how to represent time in connectionist models is very…
Expand
Highly Cited
1986
Highly Cited
1986
Automatic verification of finite-state concurrent systems using temporal logic specifications
E. Clarke
,
E. Emerson
,
A. Sistla
TOPL
1986
Corpus ID: 52853200
We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a…
Expand
Highly Cited
1983
Highly Cited
1983
On Communicating Finite-State Machines
D. Brand
,
P. Zafiropulo
JACM
1983
Corpus ID: 11607967
A model of commumcations protocols based on finite-state machines is investigated. The problem addressed is how to ensure certain…
Expand
Highly Cited
1978
Highly Cited
1978
Testing Software Design Modeled by Finite-State Machines
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
Highly Cited
1972
Highly Cited
1972
On the Synthesis of Finite-State Machines from Samples of Their Behavior
A. Biermann
,
J. Feldman
IEEE transactions on computers
1972
Corpus ID: 28452406
The Nerode realization technique for synthesizing finite-state machines from their associated right-invariant equivalence…
Expand
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)
ACCEPT & CONTINUE