Rational series and their languages
Rational series and their languages
The zig-zag power series: a two-way version of the * operator
Theoretical Computer Science - Theme issue on the algebraic and computing treatment of noncommutative power series
Stability for the zigzag submonoids
Theoretical Computer Science
Efficient detection of quasiperiodicities in strings
Theoretical Computer Science
A correction to “An optimal algorithm to compute all the covers of a string”
Information Processing Letters
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Covering submonoids and covering codes
Journal of Automata, Languages and Combinatorics
Approximate periods of strings
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Codes
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Two-Way Automata with Multiplicity
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Covering problems from a formal language point of view
DLT'03 Proceedings of the 7th international conference on Developments in language theory
| Hi-index | 0.00 |
The formal language of all words 'covered' by words in a given language is investigated. A language is a covering code when any word has at most one minimal covering over it; in this case the language generated by the covering operation is said cov-free. We study the notion of cov-freeness, in analogy to the theory developed on classical freeness. In particular cov-freeness is characterized by the notion of cov-stability introduced here. Further, cov-maximality of a regular covering code is characterized by its cov-completeness. Some more properties are obtained using these characterizations. We also show that the series counting the minimal coverings of a word over a regular language is rational. All along the paper we compare new definitions and results to their counterpart in classical monoids and in monoids of zig-zag factorizations.