AbstractThe factor transducer of a word associates to each of its factors (or subwords) their first occurrence. Optimal bounds on the size of minimal factor transducers together with an algorithm for building them are given. Analogue results and a simple algorithm are given for the case of subsequential suffix transducers. Algorithms are applied to repetition searching in words
We consider the search problem in which one nds a binary word among m words chosen randomly from the...
This article shows tight upper and lower bounds on the number of occurrences of maximal-exponent fac...
We investigate the least number of palindromic factors in an infinite word. We first consider genera...
AbstractThe factor transducer of a word associates to each of its factors (or subwords) their first ...
AbstractWe study the determinization of transducers over finite and infinite words. The first part o...
Abstract: A general way to find repetitions of factors in a given text is shown. We start with a cla...
International audienceWe study the determinization of transducers over infinite words. We consider t...
International audienceWe study the determinization of transducers over infinite words. We consider t...
In this paper we describe a factorial language, denoted by L(S, k,r), that contains all words that o...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
International audienceThe exponent of a word is the ratio of its length over its smallest period. Th...
We give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant ...
AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of ...
AbstractWe present general algorithms for minimizing sequential finite-state transducers that output...
AbstractWe give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of c...
We consider the search problem in which one nds a binary word among m words chosen randomly from the...
This article shows tight upper and lower bounds on the number of occurrences of maximal-exponent fac...
We investigate the least number of palindromic factors in an infinite word. We first consider genera...
AbstractThe factor transducer of a word associates to each of its factors (or subwords) their first ...
AbstractWe study the determinization of transducers over finite and infinite words. The first part o...
Abstract: A general way to find repetitions of factors in a given text is shown. We start with a cla...
International audienceWe study the determinization of transducers over infinite words. We consider t...
International audienceWe study the determinization of transducers over infinite words. We consider t...
In this paper we describe a factorial language, denoted by L(S, k,r), that contains all words that o...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
International audienceThe exponent of a word is the ratio of its length over its smallest period. Th...
We give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant ...
AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of ...
AbstractWe present general algorithms for minimizing sequential finite-state transducers that output...
AbstractWe give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of c...
We consider the search problem in which one nds a binary word among m words chosen randomly from the...
This article shows tight upper and lower bounds on the number of occurrences of maximal-exponent fac...
We investigate the least number of palindromic factors in an infinite word. We first consider genera...
DOI
Add to ORKG