Uniform characterizations of non-uniform complexity measures
Information and Control
Minimal nontrivial space complexity of probabilistic one-way turing machines
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
A time complexity gap for two-way probabilistic finite-state automata
SIAM Journal on Computing
Running time to recognize nonregular languages by 2-way probabilistic automata
Proceedings of the 18th international colloquium on Automata, languages and programming
On the state complexity of intersection of regular languages
ACM SIGACT News
The state complexities of some basic operations on regular languages
Theoretical Computer Science
Automaticity I: properties of a measure of descriptional complexity
Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Automata
Competing Patterns for Language Engineering
TDS '00 Proceedings of the Third International Workshop on Text, Speech and Dialogue
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Minimal Covers of Formal Languages
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
State and Transition Complexity of Watson-Crick Finite Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Hopcroft's Minimization Technique: Queues or Stacks?
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Membrane Computing
Learning finite cover automata from queries
Journal of Computer and System Sciences
Reduction Techniques for Acyclic Cover Transducers
Fundamenta Informaticae
| Hi-index | 0.00 |
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.