A combinatorial algorithm for minimizing the number of states of a deterministic finite automation

Authors:
Nicholas J. De Lillo
Affiliations:
Manhattan College, Riverdale, New York
Venue:
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Year:
1989

Citing 3
Cited 0

Computability with Pascal

Computability with Pascal
Compiler construction: theory and practice (2nd ed.)

Compiler construction: theory and practice (2nd ed.)
Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an algorithm for producing the specifications of an equivalent minimal-state deterministic finite automation over a given alphabet, given the specifications of some deterministic finite-state automation over the same alphabet. The algorithm has been designed to be converted into formal code, and has been used as a programming tool in developing applications software, particularly in the area of compiler construction.