Sciweavers

PLANX
2007
14 years 1 months ago
Lux: A Lightweight, Statically Typed XML Update Language
Several proposals for updating XML have been introduced. Many of them have a rather complicated semantics due to the interaction of side-effects and updates, and some proposals a...
James Cheney
STRINGOLOGY
2008
14 years 1 months ago
Conservative String Covering of Indeterminate Strings
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...
Pavlos Antoniou, Maxime Crochemore, Costas S. Ilio...
STRINGOLOGY
2008
14 years 1 months ago
The Road Coloring and Cerny Conjecture
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
Avraham Trahtman
STRINGOLOGY
2008
14 years 1 months ago
Dynamic Burrows-Wheeler Transform
Mikaël Salson, Thierry Lecroq, Martine L&eacu...
STRINGOLOGY
2008
14 years 1 months ago
On the Uniform Distribution of Strings
In this paper, we propose the definition of a measure for sets of strings of length not greater than a given number. This measure leads to an instanciation of the uniform distribut...
Sébastien Rebecchi, Jean-Michel Jolion
STRINGOLOGY
2008
14 years 1 months ago
In-place Update of Suffix Array while Recoding Words
Matthias Gallé, Pierre Peterlongo, Fran&cce...
STRINGOLOGY
2008
14 years 1 months ago
Fast Optimal Algorithms for Computing All the Repeats in a String
Simon J. Puglisi, William F. Smyth, Munina Yusufu
STRINGOLOGY
2008
14 years 1 months ago
Infinite Smooth Lyndon Words
In a recent paper, Brlek et al showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: what are the infinite smooth w...
Geneviève Paquin
STRINGOLOGY
2008
14 years 1 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter