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
Two-Way Automata with Multiplicity
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
A language-theoretic approach to covering problems
Journal of Automata, Languages and Combinatorics
| Hi-index | 0.00 |
We consider the formal language of all words that are 'covered' by words in a given language. This language is said cov-free when any word has at most one minimal covering over it. We study the notion of cov-freeness in relation with its counterpart in classical monoids and in monoids of zig-zag factorizations. In particular cov-freeness is characterized by the here introduced notion of cov-stability. Some more properties are obtained using this characterization. We also show that the series counting the minimal coverings of a word over a regular language is rational.