Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Puzynina, Svetlana
and
Zamboni, Luca Q.
2013.
Abelian returns in Sturmian words.
Journal of Combinatorial Theory, Series A,
Vol. 120,
Issue. 2,
p.
390.
Avgustinovich, Sergey
and
Puzynina, Svetlana
2013.
Computer Science – Theory and Applications.
Vol. 7913,
Issue. ,
p.
258.
Fici, Gabriele
Langiu, Alessio
Lecroq, Thierry
Lefebvre, Arnaud
Mignosi, Filippo
and
Prieur-Gaston, Élise
2013.
Developments in Language Theory.
Vol. 7907,
Issue. ,
p.
227.
Avgustinovich, Sergey
and
Puzynina, Svetlana
2016.
Weak Abelian Periodicity of Infinite Words.
Theory of Computing Systems,
Vol. 59,
Issue. 2,
p.
161.
Fici, Gabriele
Langiu, Alessio
Lecroq, Thierry
Lefebvre, Arnaud
Mignosi, Filippo
Peltomäki, Jarkko
and
Prieur-Gaston, Élise
2016.
Abelian powers and repetitions in Sturmian words.
Theoretical Computer Science,
Vol. 635,
Issue. ,
p.
16.
Charlier, Émilie
Harju, Tero
Puzynina, Svetlana
and
Zamboni, Luca Q.
2016.
Abelian bordered factors and periodicity.
European Journal of Combinatorics,
Vol. 51,
Issue. ,
p.
407.
Blanchet-Sadri, F.
Chen, Kun
and
Hawes, Kenneth
2017.
Dyck Words, Lattice Paths, and Abelian Borders.
Electronic Proceedings in Theoretical Computer Science,
Vol. 252,
Issue. ,
p.
56.
Cassaigne, Julien
Karhumäki, Juhani
and
Puzynina, Svetlana
2018.
On k-abelian palindromes.
Information and Computation,
Vol. 260,
Issue. ,
p.
89.
Puzynina, Svetlana
2019.
Combinatorics on Words.
Vol. 11682,
Issue. ,
p.
28.
Blanchet-Sadri, Francine
Chen, Kun
and
Hawes, Kenneth
2022.
Dyck Words, Lattice Paths, and Abelian Borders.
International Journal of Foundations of Computer Science,
Vol. 33,
Issue. 03n04,
p.
203.
Fici, Gabriele
and
Puzynina, Svetlana
2023.
Abelian combinatorics on words: A survey.
Computer Science Review,
Vol. 47,
Issue. ,
p.
100532.