A new algorithm for the construction of minimal acyclic DFAs.

DOI10.1016/S0167-6423(03)00012-1zbMath1059.68071OpenAlexW2099747032MaRDI QIDQ1426028

Bruce W. Watson

Publication date: 14 March 2004

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6423(03)00012-1

zbMATH Keywords

Recursive algorithmAlgorithmicsIncremental algorithmMinimal acyclic deterministic finite automata

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Formal languages and automata (68Q45)

Related Items (4)

ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS ⋮ Description and analysis of a bottom-up DFA minimization algorithm ⋮ From tree automata to string automata minimization ⋮ Minimisation of automata

This page was built for publication: A new algorithm for the construction of minimal acyclic DFAs.