Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Structural complexity 1
Discrete Applied Mathematics
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
On Sets Having Only Hard Subsets
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Minimal Cover-Automata for Finite Languages
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
On the existence of regular approximations
Theoretical Computer Science
Hopcroft's Minimization Technique: Queues or Stacks?
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the Hopcroft's minimization technique for DFA and DFCA
Theoretical Computer Science
The dissecting power of regular languages
Information Processing Letters
| Hi-index | 0.00 |
Let L, L驴 be languages. If L 驴 L驴, we say that L驴 covers L. Let C,D be two classes of languages. If L驴 驴 C, we say that L驴 is a minimal C-cover with respect to D if whenever L 驴 L驴 驴 L驴 and L驴 驴 C, we have L驴 - L驴 驴 D. In this paper we discuss minimal C-covers with respect to finite languages, when C is the class of regular languages.