Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
state minimization
Description:
A method in automata theory for reducing the number of states in a sequential machine while preserving its behavior.
Primary topic:
semigroups and automata theory (56%)
Related topics:
semigroups and automata theory (56%),
VLSI and FPGA Design Techniques (11%),
Formal Methods in Verification (10%)
OpenAlex ID:
keywords/state-minimization
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
1971
·
John Hopcroft
·
Elsevier eBooks
·
1,047
Finite automata play the repeated prisoner's dilemma
1986
·
Ariel Rubinstein
·
Journal of Economic Theory
·
670
Self-organization in communication networks: principles and design paradigms
2005
·
C. Prehofer
, C. Bettstetter
·
IEEE Communications Magazine
·
491
The tool Kronos
1996
·
C. Daws
, A. Olivero
, et al.
·
Lecture notes in computer science
·
483
Bisimulation for Labelled Markov Processes
2002
·
Josée Desharnais
, Abbas Edalat
, et al.
·
Information and Computation
·
372
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
1959
·
M. C. Paull
, S. H. Unger
·
IEEE Transactions on Electronic Computers
·
362
An 8-state minimal time solution to the firing squad synchronization problem
1967
·
Robert Balzer
·
Information and Control
·
198
The Theory of Definite Automata
1963
·
M. Perles
, M. O. Rabin
, et al.
·
IEEE Transactions on Electronic Computers
·
194
A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks
1965
·
A. Grasselli
, F. Luccio
·
IEEE Transactions on Electronic Computers
·
181
CCS expressions, finite state processes, and three problems of equivalence
1983
·
Paris C. Kanellakis
, Scott A. Smolka
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
171
PDF
Automatic synthesis of burst-mode asynchronous controllers
1993
·
Steven M. Nowick
·
157
Testing from Partial Deterministic FSM Specifications
2005
·
A. Petrenko
, N. Yevtushenko
·
IEEE Transactions on Computers
·
150
On the State Minimization of Nondeterministic Finite Automata
1970
·
T. Kameda
, P. Weiner
·
IEEE Transactions on Computers
·
125
Describing an algorithm by Hopcroft
1973
·
David Gries
·
Acta Informatica
·
112
On the Markov Chain Approach to the Two-Sided CUSUM Procedure
1984
·
William H. Woodall
·
Technometrics
·
104
State Reduction in Incompletely Specified Finite-State Machines
1973
·
C.P. Pfleeger
·
IEEE Transactions on Computers
·
103
Automatic synthesis of locally-clocked asynchronous state machines
2002
·
S.M. Nowick
, D.L. Dill
·
International Conference on Computer Aided Design
·
88
Synthesis of Finite State Machines : Functional Optimization
2013
·
Timothy Kam
, Tiziano Villa
, et al.
·
CERN Document Server (European Organization for Nuclear Research)
·
84
Irredundant sequential machines via optimal logic synthesis
1990
·
S. Devadas
, H.-K.T. Ma
, et al.
·
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
·
83
Automata on guarded strings and applications
2003
·
Dexter Kozen
·
Matemática Contemporânea
·
73
Amounts of nondeterminism in finite automata
1980
·
Chandra M. R. Kintala
, Detlef Wotschke
·
Acta Informatica
·
72
A fully implicit algorithm for exact state minimization
1994
·
Timothy Kam
, Tiziano Villa
, et al.
·
ACM/IEEE Design Automation Conference (DAC)
·
68
Algebra automata I: Parallel programming as a prolegomena to the categorical approach
1968
·
M.A. Arbib
, Y. Give'on
·
Information and Control
·
65
Optimized temporal monitors for SystemC
2012
·
Deian Tabakov
, Kristin Y. Rozier
, et al.
·
Formal Methods in System Design
·
60
Minimization of states in automata theory based on finite lattice-ordered monoids
2006
·
Hongxuan Lei
, Yongming Li
·
Information Sciences
·
60
Show more works
View as search
Works count:
552
Citation count:
8,689
Year
Topic
Type