Incremental construction of minimal deterministic finite cover automata

Authors:
Cezar Câmpeanu;Andrei Paun;Jason R. Smith
Affiliations:
Department of Computer Science and Information Technology, University of Prince Edward Island, Charlottetown, Canada;Department of Computer Science/Institute for Micromanufacturing, College of Engineering and Science, Louisiana Tech University, Ruston, Louisiana, LA;Department of Computer Science/Institute for Micromanufacturing, College of Engineering and Science, Louisiana Tech University, Ruston, Louisiana, LA
Venue:
Theoretical Computer Science - Implementation and application of automata
Year:
2006

Citing 8
Cited 4

Formal languages

Formal languages
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Incremental construction and maintenance of minimal finite-state automata

Computational Linguistics
Optimal insertion in deterministic DAWGs

Theoretical Computer Science
Incremental construction of minimal acyclic finite-state automata

Computational Linguistics - Special issue on finite-state methods in NLP
An efficient incremental DFA minimization algorithm

Natural Language Engineering
Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Results on Transforming NFA into DFCA

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus

Hyper-Minimization in O(n2)

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On Testing P Systems

Membrane Computing
Finite state based testing of P systems

Natural Computing: an international journal
Learning finite cover automata from queries

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a fast incremental algorithm for constructing minimal Deterministic Finite Cover Automata (DFCA) for a given language. Since it was shown that the minimal DFCA for a language L has less states than the minimal Deterministic Finite Automata (DFA) for the same language L, this technique seems to be the best choice for incrementally building the automaton for a large language, especially when the number of states in the DFCA is significantly less than the number of states in the corresponding minimal DFA. We have implemented the proposed algorithm and have tested it against the best-known DFCA minimization technique.