default search action
Svetlana Puzynina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland:
On abelian closures of infinite non-binary words. Discret. Math. 347(9): 114069 (2024) - [j26]Olga G. Parshina
, Svetlana Puzynina:
Finite and infinite closed-rich words. Theor. Comput. Sci. 984: 114315 (2024) - 2023
- [j25]Gabriele Fici
Abelian combinatorics on words: A survey. Comput. Sci. Rev. 47: 100532 (2023) - [j24]Sergey Luchinin, Svetlana Puzynina:
Sequences of symmetry groups of infinite words. Discret. Math. 346(1): 113171 (2023) - [j23]Thierry Lecroq, Svetlana Puzynina:
TCS special issue: Combinatorics on Words - WORDS 2021. Theor. Comput. Sci. 952: 113688 (2023) - 2022
- [j22]Svetlana Puzynina, Markus A. Whiteland:
Abelian closures of infinite binary words. J. Comb. Theory A 185: 105524 (2022) - [i18]Valérie Berthé, Svetlana Puzynina:
On the rigidity of Arnoux-Rauzy words. CoRR abs/2205.07707 (2022) - [i17]Gabriele Fici
Abelian Combinatorics on Words: a Survey. CoRR abs/2207.09937 (2022) - 2021
- [c16]Olga G. Parshina, Svetlana Puzynina:
On Closed-Rich Words. CSR 2021: 381-394 - [c15]Sergey Luchinin, Svetlana Puzynina:
Symmetry Groups of Infinite Words. DLT 2021: 267-278 - [e1]Thierry Lecroq
Combinatorics on Words - 13th International Conference, WORDS 2021, Rouen, France, September 13-17, 2021, Proceedings. Lecture Notes in Computer Science 12847, Springer 2021, ISBN 978-3-030-85087-6 [contents] - [i16]Olga G. Parshina, Svetlana Puzynina:
Finite and infinite closed-rich words. CoRR abs/2111.00863 (2021) - 2020
- [j21]Émilie Charlier
Recurrence along directions in multidimensional words. Discret. Math. 343(10): 112006 (2020) - [i15]Svetlana Puzynina, Markus A. Whiteland:
Abelian Closures of Infinite Binary Words. CoRR abs/2008.08125 (2020) - [i14]Svetlana Puzynina, Mathieu Sablik:
On entropies of block-gluing subshifts. CoRR abs/2012.09415 (2020) - [i13]Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland:
On Abelian Closures of Infinite Non-binary Words. CoRR abs/2012.14701 (2020)
2010 – 2019
- 2019
- [j20]Svetlana Puzynina:
Aperiodic Two-Dimensional Words of Small Abelian Complexity. Electron. J. Comb. 26(4): 4 (2019) - [j19]Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
On abelian saturated infinite words. Theor. Comput. Sci. 792: 154-160 (2019) - [c14]Svetlana Puzynina:
Abelian Properties of Words. WORDS 2019: 28-45 - [c13]Émilie Charlier, Svetlana Puzynina, Élise Vandomme
Recurrence in Multidimensional Words. LATA 2019: 397-408 - 2018
- [j18]Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina:
On k-abelian palindromes. Inf. Comput. 260: 89-98 (2018) - [c12]Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
On Abelian Subshifts. DLT 2018: 453-464 - 2017
- [j17]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Minimal complexity of equidistributed infinite permutations. Eur. J. Comb. 65: 24-36 (2017) - [j16]Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
k-Abelian Equivalence and Rationality. Fundam. Informaticae 154(1-4): 65-94 (2017) - [j15]Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland
On cardinalities of k-abelian equivalence classes. Theor. Comput. Sci. 658: 190-204 (2017) - 2016
- [j14]Émilie Charlier, Tero Harju
Abelian bordered factors and periodicity. Eur. J. Comb. 51: 407-418 (2016) - [j13]Sergey V. Avgustinovich, Svetlana Puzynina:
Weak Abelian Periodicity of Infinite Words. Theory Comput. Syst. 59(2): 161-179 (2016) - [j12]L'ubomíra Balková
Aperiodic pseudorandom number generators based on infinite words. Theor. Comput. Sci. 647: 85-100 (2016) - [c11]Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
k-Abelian Equivalence and Rationality. DLT 2016: 77-88 - [i12]Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland:
On cardinalities of k-abelian equivalence classes. CoRR abs/1605.03319 (2016) - [i11]Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
Cost and dimension of words of zero topological entropy. CoRR abs/1607.04728 (2016) - 2015
- [j11]Mike Müller, Svetlana Puzynina, Michaël Rao:
On Shuffling of Infinite Square-Free Words. Electron. J. Comb. 22(1): 1 (2015) - [c10]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Canonical Representatives of Morphic Permutations. WORDS 2015: 59-72 - [c9]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Ergodic Infinite Permutations of Minimal Complexity. DLT 2015: 71-84 - [i10]Emilie Charlier, Tero Harju, Svetlana Puzynina, Luca Q. Zamboni:
Abelian bordered factors and periodicity. CoRR abs/1501.07464 (2015) - [i9]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Ergodic infinite permutations of minimal complexity. CoRR abs/1503.06188 (2015) - [i8]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Canonical Representatives of Morphic Permutations. CoRR abs/1510.08371 (2015) - 2014
- [j10]Emilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni:
Infinite self-shuffling words. J. Comb. Theory A 128: 1-40 (2014) - [c8]Juhani Karhumäki, Svetlana Puzynina:
On k-Abelian Palindromic Rich and Poor Words. Developments in Language Theory 2014: 191-202 - [c7]Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
Subword Complexity and Decomposition of the Set of Factors. MFCS (1) 2014: 147-158 - [i7]Mike Müller, Svetlana Puzynina, Michaël Rao:
Infinite square-free self-shuffling words. CoRR abs/1401.6536 (2014) - [i6]Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
Subword complexity and decomposition of the set of factors. CoRR abs/1406.3974 (2014) - 2013
- [j9]Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
On palindromic factorization of words. Adv. Appl. Math. 50(5): 737-748 (2013) - [j8]Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
Fine and Wilf's Theorem for k-Abelian Periods. Int. J. Found. Comput. Sci. 24(7): 1135-1152 (2013) - [j7]Svetlana Puzynina, Luca Q. Zamboni:
Abelian returns in Sturmian words. J. Comb. Theory A 120(2): 390-408 (2013) - [j6]Maria Axenovich, Yury Person
A regularity lemma and twins in words. J. Comb. Theory A 120(4): 733-743 (2013) - [j5]Michelangelo Bucci, Neil Hindman, Svetlana Puzynina, Luca Q. Zamboni:
On additive properties of sets defined by the Thue-Morse word. J. Comb. Theory A 120(6): 1235-1245 (2013) - [c6]Sergey V. Avgustinovich, Svetlana Puzynina:
Weak Abelian Periodicity of Infinite Words. CSR 2013: 258-270 - [c5]L'ubomíra Balková, Michelangelo Bucci, Alessandro De Luca
Infinite Words with Well Distributed Occurrences. WORDS 2013: 46-57 - [c4]Emilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni:
Self-shuffling Words. ICALP (2) 2013: 113-124 - [i5]Emilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni:
Self-Shuffling Words. CoRR abs/1302.3844 (2013) - [i4]Sergey V. Avgustinovich, Svetlana Puzynina:
Weak abelian periodicity of infinite words. CoRR abs/1302.4359 (2013) - [i3]L'ubomíra Balková, Michelangelo Bucci, Alessandro De Luca, Jirí Hladký, Svetlana Puzynina:
Aperiodic pseudorandom number generators based on infinite words. CoRR abs/1311.6002 (2013) - 2012
- [j4]Sergey V. Avgustinovich, Juhani Karhumäki, Svetlana Puzynina:
On abelian versions of critical factorization theorem. RAIRO Theor. Informatics Appl. 46(1): 3-15 (2012) - [c3]Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
Fine and Wilf's Theorem for k-Abelian Periods. Developments in Language Theory 2012: 296-307 - [i2]Maria Axenovich, Yury Person, Svetlana Puzynina:
A regularity lemma and twins in words. CoRR abs/1204.2180 (2012) - [i1]Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
On minimal factorizations of words as products of palindromes. CoRR abs/1210.6179 (2012) - 2011
- [j3]Juhani Karhumäki, Svetlana Puzynina:
Locally catenative sequences and Turtle graphics. RAIRO Theor. Informatics Appl. 45(3): 311-330 (2011) - [c2]Svetlana Puzynina, Luca Q. Zamboni:
Abelian returns in Sturmian words. WORDS 2011: 179-188
2000 – 2009
- 2009
- [j2]S. A. Puzynina:
On periodicity of generalized two-dimensional infinite words. Inf. Comput. 207(11): 1315-1328 (2009) - 2008
- [j1]S. A. Puzynina, Sergey V. Avgustinovich:
On periodicity of two-dimensional words. Theor. Comput. Sci. 391(1-2): 178-187 (2008) - [c1]Svetlana Puzynina:
On Periodicity of Generalized Two-Dimensional Words. LATA 2008: 440-451
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: