Pseudoperiodic words

Authors:
Alexandre Blondin Massé;Sébastien Gaboury;Sylvain Hallé
Affiliations:
Département d'informatique et de mathématique, Université du Québec à Chicoutimi, Chicoutimi, QC, Canada;Département d'informatique et de mathématique, Université du Québec à Chicoutimi, Chicoutimi, QC, Canada;Département d'informatique et de mathématique, Université du Québec à Chicoutimi, Chicoutimi, QC, Canada
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 10
Cited 0

Some combinatorial properties of Sturmian words

Theoretical Computer Science
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Sturmian words: structure, combinatorics, and their arithmetics

Theoretical Computer Science - Special issue: formal language theory
Fine and Wilf's theorem for three periods and a generalization of Sturmian words

Theoretical Computer Science
On Fine and Wilf's theorem for bidimensional words

Theoretical Computer Science
Generalised fine and Wilf's theorem for arbitrary number of periods

Theoretical Computer Science - Combinatorics on words
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)

Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Pseudopalindrome closure operators in free monoids

Theoretical Computer Science
Fine and Wilf words for any periods II

Theoretical Computer Science
An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words

DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

nand