1,283 research outputs found
On the combinatorics of suffix arrays
We prove several combinatorial properties of suffix arrays, including a
characterization of suffix arrays through a bijection with a certain
well-defined class of permutations. Our approach is based on the
characterization of Burrows-Wheeler arrays given in [1], that we apply by
reducing suffix sorting to cyclic shift sorting through the use of an
additional sentinel symbol. We show that the characterization of suffix arrays
for a special case of binary alphabet given in [2] easily follows from our
characterization. Based on our results, we also provide simple proofs for the
enumeration results for suffix arrays, obtained in [3]. Our approach to
characterizing suffix arrays is the first that exploits their relationship with
Burrows-Wheeler permutations
String Comparison in -Order: New Lexicographic Properties & On-line Applications
-order is a global order on strings related to Unique Maximal
Factorization Families (UMFFs), which are themselves generalizations of Lyndon
words. -order has recently been proposed as an alternative to
lexicographical order in the computation of suffix arrays and in the
suffix-sorting induced by the Burrows-Wheeler transform. Efficient -ordering
of strings thus becomes a matter of considerable interest. In this paper we
present new and surprising results on -order in strings, then go on to
explore the algorithmic consequences
Morphic words and equidistributed sequences
The problem we consider is the following: Given an infinite word on an
ordered alphabet, construct the sequence , equidistributed on
and such that if and only if ,
where is the shift operation, erasing the first symbol of . The
sequence exists and is unique for every word with well-defined positive
uniform frequencies of every factor, or, in dynamical terms, for every element
of a uniquely ergodic subshift. In this paper we describe the construction of
for the case when the subshift of is generated by a morphism of a
special kind; then we overcome some technical difficulties to extend the result
to all binary morphisms. The sequence in this case is also constructed
with a morphism.
At last, we introduce a software tool which, given a binary morphism
, computes the morphism on extended intervals and first elements of
the equidistributed sequences associated with fixed points of
Universal Cycles of Restricted Words
A connected digraph in which the in-degree of any vertex equals its
out-degree is Eulerian, this baseline result is used as the basis of existence
proofs for universal cycles (also known as generalized deBruijn cycles or
U-cycles) of several combinatorial objects. We extend the body of known results
by presenting new results on the existence of universal cycles of monotone,
"augmented onto", and Lipschitz functions in addition to universal cycles of
certain types of lattice paths and random walks.Comment: 21 pages, 4 figure
More Structural Characterizations of Some Subregular Language Families by Biautomata
We study structural restrictions on biautomata such as, e.g., acyclicity,
permutation-freeness, strongly permutation-freeness, and orderability, to
mention a few. We compare the obtained language families with those induced by
deterministic finite automata with the same property. In some cases, it is
shown that there is no difference in characterization between deterministic
finite automata and biautomata as for the permutation-freeness, but there are
also other cases, where it makes a big difference whether one considers
deterministic finite automata or biautomata. This is, for instance, the case
when comparing strongly permutation-freeness, which results in the family of
definite language for deterministic finite automata, while biautomata induce
the family of finite and co-finite languages. The obtained results nicely fall
into the known landscape on classical language families.Comment: In Proceedings AFL 2014, arXiv:1405.527
Compressed Representations of Permutations, and Applications
We explore various techniques to compress a permutation over n
integers, taking advantage of ordered subsequences in , while supporting
its application (i) and the application of its inverse in
small time. Our compression schemes yield several interesting byproducts, in
many cases matching, improving or extending the best existing results on
applications such as the encoding of a permutation in order to support iterated
applications of it, of integer functions, and of inverted lists and
suffix arrays
Inflations of geometric grid classes of permutations
All three authors were partially supported by EPSRC via the grant EP/J006440/1.Geometric grid classes and the substitution decomposition have both been shown to be fundamental in the understanding of the structure of permutation classes. In particular, these are the two main tools in the recent classification of permutation classes of growth rate less than Îș â 2.20557 (a specific algebraic integer at which infinite antichains first appear). Using language- and order-theoretic methods, we prove that the substitution closures of geometric grid classes are well partially ordered, finitely based, and that all their subclasses have algebraic generating functions. We go on to show that the inflation of a geometric grid class by a strongly rational class is well partially ordered, and that all its subclasses have rational generating functions. This latter fact allows us to conclude that every permutation class with growth rate less than Îș has a rational generating function. This bound is tight as there are permutation classes with growth rate Îș which have nonrational generating functions.PostprintPeer reviewe
Universal Lyndon Words
A word over an alphabet is a Lyndon word if there exists an
order defined on for which is lexicographically smaller than all
of its conjugates (other than itself). We introduce and study \emph{universal
Lyndon words}, which are words over an -letter alphabet that have length
and such that all the conjugates are Lyndon words. We show that universal
Lyndon words exist for every and exhibit combinatorial and structural
properties of these words. We then define particular prefix codes, which we
call Hamiltonian lex-codes, and show that every Hamiltonian lex-code is in
bijection with the set of the shortest unrepeated prefixes of the conjugates of
a universal Lyndon word. This allows us to give an algorithm for constructing
all the universal Lyndon words.Comment: To appear in the proceedings of MFCS 201
A New Technique for Reachability of States in Concatenation Automata
We present a new technique for demonstrating the reachability of states in
deterministic finite automata representing the concatenation of two languages.
Such demonstrations are a necessary step in establishing the state complexity
of the concatenation of two languages, and thus in establishing the state
complexity of concatenation as an operation. Typically, ad-hoc induction
arguments are used to show particular states are reachable in concatenation
automata. We prove some results that seem to capture the essence of many of
these induction arguments. Using these results, reachability proofs in
concatenation automata can often be done more simply and without using
induction directly.Comment: 23 pages, 1 table. Added missing affiliation/funding informatio
- âŠ