An n log n algorithm for minimizing states in a finite automaton

Authors:
John E. Hopcroft
Affiliations:
-
Venue:
An n log n algorithm for minimizing states in a finite automaton
Year:
1971

Citing 0
Cited 31

A new algorithm for the reduction of incompletely specified finite state machines

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
3-Party message complexity is better than 2-party ones for proving lower bounds on the size of minimal nondeterministic finite automata

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Descriptional complexity of finite automata: concepts and open problems

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
New languages from old: The extension of programming languages by embedding, with a case study

ICSE '76 Proceedings of the 2nd international conference on Software engineering
On state reduction of incompletely specified finite state machines

Computers and Electrical Engineering
Computing Alignment Seed Sensitivity with Probabilistic Arithmetic Automata

WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
State-dependent computation using coupled recurrent networks

Neural Computation
Bisimilarity Minimization in O(m logn) Time

PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
A Table Compression Method for Extended Aho-Corasick Automaton

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Memory reduction for strategies in infinite games

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Fault tolerance in finite state machines using fusion

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Extending automated compositional verification to the full class of omega-regular languages

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
The average complexity of Moore's state minimization algorithm is O(n log log n)

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Querying contract databases based on temporal behavior

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
An algebraic characterization of strictly piecewise languages

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Transition function complexity of finite automata

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Better algorithms for analyzing and enacting declarative workflow languages using LTL

BPM'11 Proceedings of the 9th international conference on Business process management
Unsupervised multilingual learning

Unsupervised multilingual learning
Fast brief practical DFA minimization

Information Processing Letters
Average complexity of Moore's and Hopcroft's algorithms

Theoretical Computer Science
When simulation meets antichains: on checking language inclusion of nondeterministic finite (tree) automata

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Fused state machines for fault tolerance in distributed systems

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Automata-Based symbolic representations of polyhedra

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Optimized inlining of runtime monitors

NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
Compact Representations and Efficient Algorithms for Operating Guidelines

Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Deep packet inspection tools and techniques in commodity platforms: Challenges and trends

Journal of Network and Computer Applications
Active continuous quality control

Proceedings of the 16th International ACM Sigsoft symposium on Component-based software engineering
Unifying FSM-inference algorithms through declarative specification

Proceedings of the 2013 International Conference on Software Engineering
On the expressiveness of spider diagrams and commutative star-free regular languages

Journal of Visual Languages and Computing
Picking pesky parameters: optimizing regular expression matching in practice

ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
Isomorph-free branch and bound search for finite state controllers

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm is given for minimizing the number of states in a finite automaton or for determining if two finite automata are equivalent. The asymptotic running time of the algorithm is bounded by k n log n where k is some constant and n is the number of states. The constant k depends linearly on the size of the input alphabet.