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 coverautomaton of the language. We also give algorithms for the boolean operations on deterministic cover automata, i.e., on the finite languages they represent.
Unable to display preview. Download preview PDF.
- 3.Cezar C ampeanu. Regular languages and programming languages, Revue Roumaine de Linguistique-CLTA, 23 (1986), 7–10.Google Scholar
- 7.J. Kaneps, R. Freivalds, Minimal Nontrivial Space Space Complexity of Probabilistic One-Way Turing Machines, in Proceedings of Mathematical Foundations of Computer Science, Banská Bystryca, Czechoslovakia, August 1990, Lecture Notes in Computer Science, vol 452, pp. 355–361, Springer-Verlag, New York/Berlin, 1990.CrossRefGoogle Scholar
- 8.J. Kaneps, R. Freivalds, Running time to recognise non-regular languages by 2-way probabilistic automata, in ICALP’91, Lecture Notes in Computer Science, vol 510, pp. 174–185, Springer-Verlag, New York/Berlin, 1991.Google Scholar
- 13.B.A. Trakhtenbrot, Ya. M. Barzdin, Finite Automata: Behaviour and Synthesis, Fundamental Studies in Computer Science, Vol.1, North-Holland, Amsterdam, 1973.Google Scholar
- 15.S. Yu, Regular Languages, Handbook of Formal Languages, Springer Verlag, 1995.Google Scholar