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
Revised Papers from the Third International Workshop on Automata Implementation
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Minimal Cover-Automata for Finite Languages
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Hopcroft's Minimization Technique: Queues or Stacks?
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
An incremental algorithm for constructing minimal deterministic finite cover automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Reduction Techniques for Acyclic Cover Transducers
Fundamenta Informaticae
| Hi-index | 0.00 |
Cover automata were introduced in [1] as an efficient representation of finite languages. In [1], an algorithm was given to transform a DFA that accepts a finite language to a minimal deterministic finite cover automaton (DFCA) with the time complexity O(n4), where n is the number of states of the given DFA. In this paper, we introduce a new efficient transformation algorithm with the time complexity O(n2), which is a significant improvement from the previous algorithm.