Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
84
views
0
references
Top references
cited by
81
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,153
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory of Machines and Computations
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
edited_book
Author(s):
John Hopcroft
Publication date
(Print):
1971
Publisher:
Elsevier
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
CHAIN Network Collection
Author and book information
Book Chapter
Publication date (Print):
1971
Pages
: 189-196
DOI:
10.1016/B978-0-12-417750-5.50022-1
SO-VID:
a3115b13-56be-423b-aab8-3bb43ac54ed9
License:
https://www.elsevier.com/tdm/userlicense/1.0/
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 19
COMPUTATIONALLY COMPLEX AND PSEUDO-RANDOM ZERO-ONE VALUED FUNCTIONS††Portions of this work were carried out at Carngie-Mellon University, while the authors were in the Department of Computer Science. Portions of these results were reported in preliminary form in [1].
pp. 71
QUEUES, STACKS AND GRAPHS
pp. 123
FORMAL LANGUAGES AND FORMAL POWER SERIES
pp. 189
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
Similar content
2,153
Cellular automaton decoders of topological quantum memories in the fault tolerant setting
Authors:
Jens Eisert
,
Michael Herold
,
Michael J. Kastoryano
…
Cellular automaton models for time-correlated random walks: derivation and analysis
Authors:
J. M. Nava-Sedeño
,
H Hatzikirou
,
R Klages
…
Experimenter as automaton; experimenter as human: exploring the position of the researcher in scientific research
Authors:
Sarahanne M. Field
,
Maarten Derksen
See all similar
Cited by
81
Principles and methods of testing finite state machines-a survey
Authors:
M Yannakakis
,
D. Lee
A survey of the algorithmic aspects of modular decomposition
Authors:
Christophe Paul
,
Michel Habib
Iterating Transducers in the Large
Authors:
Bernard Boigelot
,
Axel Legay
,
Pierre Wolper
See all cited by