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
AbstractWe study in a probabilistic framework some topics concerning the way words can overlap. Our ...
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...
AbstractThe factor transducer of a word associates to each of its factors (or subwords) their first ...
AbstractSuffix automata and factor automata are efficient data structures for representing the full ...
AbstractWe present general algorithms for minimizing sequential finite-state transducers that output...
This paper gives optimal parallel algorithms for the construction of the smallest deterministic fini...
AbstractThis paper gives a linear-time algorithm for the construction of the suffix tree of a tree, ...
This paper gives a linear-time algorithm for the construction of thesuffix tree of a tree. The suffi...
International audienceSequence Analysis requires to elaborate data structures which allow both an ef...
AbstractWe consider the following problem: Instance: a finite alphabet A, a biprefix code X = {x, y}...
AbstractThe suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministi...
This paper studies in a probabilistic framework some topics concerning the way words (strings) can o...
summary:This paper concerns searching substrings in a string using the factor automaton. The factor ...
International audienceWe study the determinization of transducers over infinite words. We consider t...
AbstractWe study in a probabilistic framework some topics concerning the way words can overlap. Our ...
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...
AbstractThe factor transducer of a word associates to each of its factors (or subwords) their first ...
AbstractSuffix automata and factor automata are efficient data structures for representing the full ...
AbstractWe present general algorithms for minimizing sequential finite-state transducers that output...
This paper gives optimal parallel algorithms for the construction of the smallest deterministic fini...
AbstractThis paper gives a linear-time algorithm for the construction of the suffix tree of a tree, ...
This paper gives a linear-time algorithm for the construction of thesuffix tree of a tree. The suffi...
International audienceSequence Analysis requires to elaborate data structures which allow both an ef...
AbstractWe consider the following problem: Instance: a finite alphabet A, a biprefix code X = {x, y}...
AbstractThe suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministi...
This paper studies in a probabilistic framework some topics concerning the way words (strings) can o...
summary:This paper concerns searching substrings in a string using the factor automaton. The factor ...
International audienceWe study the determinization of transducers over infinite words. We consider t...
AbstractWe study in a probabilistic framework some topics concerning the way words can overlap. Our ...
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...
DOI
Add to ORKG