On the State Minimization of Nondeterministic Finite Automata

Authors:
T. Kameda;P. Weiner
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1970

Citing 3
Cited 20

Design of Sequential Machines from Their Regular Expressions

Journal of the ACM (JACM)
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Finite automata and their decision problems

IBM Journal of Research and Development

FA Minimisation Heuristics for a Class of Finite Languages

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Discrete Optimization Problems - Some New Heuristic Approaches

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's

Theoretical Computer Science
Compact Normal Form for Regular Languages as Xor Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
NFA reduction algorithms by means of regular inequalities

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Bideterministic automata and minimal representations of regular languages

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
On transition minimality of bideterministic automata

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Fuzzy relation equations and reduction of fuzzy automata

Journal of Computer and System Sciences
Reducing nondeterministic finite automata with SAT solvers

FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Limitations of lower bound methods for deterministic nested word automata

Information and Computation
Theory of átomata

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Nondeterministic Moore automata and Brzozowski's algorithm

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Reducing the size of NFAs by using equivalences and preorders

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Minimal unambiguous εNFA

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Minimalizations of NFA using the universal automaton

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Finding lower bounds for nondeterministic state complexity is hard

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Size reduction of multitape automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Nondeterministic Moore automata and Brzozowski's minimization algorithm

Theoretical Computer Science
Theoretical study and implementation of the canonical automaton

Fundamenta Informaticae

Quantified Score

Hi-index	14.98

Visualization

Abstract

The aim of this paper is to obtain a procedure for finding a minimum state nondeterministic finite automaton (NDA) equivalent to a given (in general, nondeterministic) finite automaton. Given a finite automaton A, we derive from A a matrix of 1' s and 0's, called a reduced automaton matrix RAM) of A, in a certain way and show that each state of A corresponds to a grid over the RAM. A grid consists of a set of rows and a set of columns of an RAM such that only 1's appear at the intersections. It is also shown that the union of all the grids, each of which corresponds to a state of A, covers all the 1 entries of an RAM.