Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
81
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,817
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,817
Simulation of stress-assisted localised corrosion using a cellular automaton finite element approach
Authors:
R. Akid
,
O.O. Fatoba
,
S.V. Lishchuk
…
Finite automaton from a flowchart scheme point of view
Authors:
Calvin C. Elgot
Prediction of dendritic microstructure using the cellular automaton-Finite Element Method for hypoeutectic Al-Si Alloys Castings
Authors:
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