publication . Part of book or chapter of book . Preprint . 2014

universal lyndon words

Carpi, Arturo; Fici, Gabriele; Holub, Stepan; Oprsal, Jakub; Sciortino, Marinella;
Restricted
  • Published: 23 Jun 2014
  • Publisher: Springer Berlin Heidelberg
Abstract
Comment: To appear in the proceedings of MFCS 2014
Subjects
arXiv: Computer Science::Formal Languages and Automata TheoryComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Mathematics::Group TheoryComputer Science::Discrete MathematicsMathematics::Representation Theory
free text keywords: Bijection, Combinatorics on words, Alphabet, Existential quantification, Lyndon words, Discrete mathematics, Prefix, Lyndon word, Lexicographical order, Combinatorics, Mathematics, Computer Science - Discrete Mathematics, Computer Science - Formal Languages and Automata Theory, Mathematics - Combinatorics, 68R15
Related Organizations

1. A. Carpi and A. de Luca. Words and special factors. Theoret. Comput. Sci., 259(1- 2):145-182, 2001.

2. F. Chung, P. Diaconis, and R. Graham. Universal cycles for combinatorial structures. Discrete Math., 110:43-59, 1992.

3. A. E. Holroyd, F. Ruskey, and A. Williams. Shorthand universal cycles for permutations. Algorithmica, 64(2):215-245, 2012. [OpenAIRE]

4. B. Jackson. Universal cycles of k-subsets and k-permutations. Discrete Math., 117(1-3):141-150, 1993.

5. M. Lothaire. Combinatorics on words. Cambridge University Press, Cambridge, 1997.

6. F. Ruskey and A. Williams. An explicit universal cycle for the (n − 1)-permutations of an n-set. ACM Trans. Algorithms, 6(3), article 45, 2010.

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Part of book or chapter of book . Preprint . 2014

universal lyndon words

Carpi, Arturo; Fici, Gabriele; Holub, Stepan; Oprsal, Jakub; Sciortino, Marinella;