Sciweavers

WIA
1998
Springer

Minimal Cover-Automata for Finite Languages

14 years 4 months ago
Minimal Cover-Automata for Finite Languages
A cover-automaton A of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic cover automaton of a finite language L usually has a smaller size than a minimal DFA that accept L. Thus, cover automata can be used to reduce the size of the representations of finite languages in practice. In this paper, we describe an efficient algorithm that, for a given DFA accepting a finite language, constructs a minimal deterministic finite cover- automaton of the language. We also give algorithms for the boolean operations on deterministic cover automata, i.e., on the finite languages they represent.
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1998
Where WIA
Authors Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Comments (0)