Incremental DFA minimisation

Authors:
Marco Almeida;Nelma Moreira;Rogério Reis
Affiliations:
DCC-FC & LIACC, Universidade do Porto, Porto, Portugal;DCC-FC & LIACC, Universidade do Porto, Porto, Portugal;DCC-FC & LIACC, Universidade do Porto, Porto, Portugal
Venue:
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Year:
2010

Citing 6
Cited 0

Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Introduction to Algorithms

Introduction to Algorithms
An efficient incremental DFA minimization algorithm

Natural Language Engineering
Enumeration and generation with a string automata representation

Theoretical Computer Science
FAdo and GUItar

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new incremental algorithm for minimising deterministic finite automata. It runs in quadratic time for any practical application and may be halted at any point, returning a partially minimised automaton. Hence, the algorithm may be applied to a given automaton at the same time as it is processing a string for acceptance. We also include some experimental comparative results.