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
Handbook of formal languages, vol. 1
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Automata
Succinct representations of languages by DFA with different levels of reliability
Theoretical Computer Science - Descriptional complexity of formal systems
Tradeoffs between reliability and conciseness of deterministic finite automata
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
On the existence of regular approximations
Theoretical Computer Science
Membrane Computing
On the Hopcroft's minimization technique for DFA and DFCA
Theoretical Computer Science
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Finite state based testing of P systems
Natural Computing: an international journal
Bounded sequence testing from deterministic finite state machines
Theoretical Computer Science
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Reducing acyclic cover transducers
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton
Theoretical Computer Science
Computing all l-cover automata fast
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Learning finite cover automata from queries
Journal of Computer and System Sciences
Bounded sequence testing from non-deterministic finite state machines
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Minimizing state transition model for multiclassification by mixed-integer programming
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
An incremental algorithm for constructing minimal deterministic finite cover automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Learn and test for event-b --- a rodin plugin
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
Reduction Techniques for Acyclic Cover Transducers
Fundamenta Informaticae
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Model learning and test generation for event-b decomposition
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Brzozowski's minimization algorithm: more robust than expected
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 5.23 |
A cover-automaton A of a finite language L &Sgr; is a finite deterministic automaton (DFA) that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic finite cover automaton (DFCA) of a finite language L usually has a smaller size than a minimal DFA that accepts 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.