default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca Q. Zamboni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j45]Sébastien Ferenczi, Luca Q. Zamboni:
Clustering and Arnoux-Rauzy words. Adv. Appl. Math. 153: 102621 (2024)- 2023
- [c12]Sébastien Ferenczi, Pascal Hubert, Luca Q. Zamboni:
Order Conditions for Languages. WORDS 2023: 155-167 - 2021
- [c11]Gerhard Ramharter, Luca Q. Zamboni:
Continuants with Equal Values, a Combinatorial Approach. WORDS 2021: 20-26 - [i24]Alessandro De Luca, Marcia Edson, Luca Q. Zamboni:
Extremal values of semi-regular continuants and codings of interval exchange transformations. CoRR abs/2105.00496 (2021) - [i23]Alessandro De Luca, Luca Q. Zamboni:
On the extremal values of the cyclic continuants of Motzkin and Straus. CoRR abs/2108.11313 (2021) - 2020
- [j44]Mickaël Postic, Luca Q. Zamboni:
ω-Lyndon words. Theor. Comput. Sci. 809: 39-44 (2020) - [j43]Mickaël Postic, Luca Q. Zamboni:
Reprint of: ω-Lyndon words. Theor. Comput. Sci. 834: 60-65 (2020)
2010 – 2019
- 2019
- [j42]Olga G. Parshina, Luca Q. Zamboni:
Open and closed factors in Arnoux-Rauzy words. Adv. Appl. Math. 107: 22-31 (2019) - [j41]Neil Hindman, Dona Strauss, Luca Q. Zamboni:
Combining Extensions of the Hales-Jewett Theorem with Ramsey Theory in Other Structures. Electron. J. Comb. 26(4): 4 (2019) - 2018
- [j40]Gabriele Fici
, Antonio Restivo, Manuel Silva, Luca Q. Zamboni:
Anti-powers in infinite words. J. Comb. Theory A 157: 109-119 (2018) - 2017
- [j39]Alessandro De Luca, Gabriele Fici, Luca Q. Zamboni:
The sequence of open and closed prefixes of a Sturmian word. Adv. Appl. Math. 90: 27-45 (2017) - [j38]Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni:
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. Acta Cybern. 23(1): 175-189 (2017) - [j37]Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni:
Cyclic complexity of words. J. Comb. Theory A 145: 36-56 (2017) - [i22]Alessandro De Luca, Gabriele Fici, Luca Q. Zamboni:
The sequence of open and closed prefixes of a Sturmian word. CoRR abs/1701.01580 (2017) - [i21]Jean-Paul Allouche, Julien Cassaigne, Jeffrey O. Shallit, Luca Q. Zamboni:
A Taxonomy of Morphic Sequences. CoRR abs/1711.10807 (2017) - 2016
- [j36]Émilie Charlier, Tero Harju, Svetlana Puzynina, Luca Q. Zamboni:
Abelian bordered factors and periodicity. Eur. J. Comb. 51: 407-418 (2016) - [j35]Aldo de Luca, Luca Q. Zamboni:
On prefixal factorizations of words. Eur. J. Comb. 52: 59-73 (2016) - [j34]Aldo de Luca, Luca Q. Zamboni:
On some variations of coloring problems of infinite words. J. Comb. Theory A 137: 166-178 (2016) - [c10]Gabriele Fici, Antonio Restivo, Manuel Silva, Luca Q. Zamboni:
Anti-Powers in Infinite Words. ICALP 2016: 124:1-124:9 - [i20]Gabriele Fici, Antonio Restivo, Manuel Silva, Luca Q. Zamboni:
Anti-Powers in Infinite Words. CoRR abs/1606.02868 (2016) - [i19]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
- [j33]Tero Harju, Mari Huova, Luca Q. Zamboni:
On generating binary words palindromically. J. Comb. Theory A 129: 142-159 (2015) - [j32]Juhani Karhumäki, Luca Q. Zamboni:
Words 2013. Theor. Comput. Sci. 601: 1 (2015) - [i18]Emilie Charlier, Tero Harju, Svetlana Puzynina, Luca Q. Zamboni:
Abelian bordered factors and periodicity. CoRR abs/1501.07464 (2015) - 2014
- [j31]James D. Currie, Narad Rampersad, Kalle Saari, Luca Q. Zamboni:
Extremal words in morphic subshifts. Discret. Math. 322: 53-60 (2014) - [j30]Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni:
A coloring problem for infinite words. J. Comb. Theory A 125: 306-332 (2014) - [j29]Emilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni:
Infinite self-shuffling words. J. Comb. Theory A 128: 1-40 (2014) - [c9]Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni:
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. Developments in Language Theory 2014: 203-214 - [c8]Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
Subword Complexity and Decomposition of the Set of Factors. MFCS (1) 2014: 147-158 - [c7]Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni:
Cyclic Complexity of Words. MFCS (1) 2014: 159-170 - [i17]Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni:
Cyclic Complexity of Words. CoRR abs/1402.5843 (2014) - [i16]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
- [j28]Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
On palindromic factorization of words. Adv. Appl. Math. 50(5): 737-748 (2013) - [j27]Svetlana Puzynina, Luca Q. Zamboni:
Abelian returns in Sturmian words. J. Comb. Theory A 120(2): 390-408 (2013) - [j26]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) - [j25]Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni:
On a generalization of Abelian equivalence and complexity of infinite words. J. Comb. Theory A 120(8): 2189-2206 (2013) - [j24]Gabriele Fici, Luca Q. Zamboni:
On the least number of palindromes contained in an infinite word. Theor. Comput. Sci. 481: 1-8 (2013) - [j23]Michelangelo Bucci, Alessandro De Luca, Luca Q. Zamboni:
Reversible Christoffel factorizations. Theor. Comput. Sci. 495: 17-24 (2013) - [c6]Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni:
A Coloring Problem for Sturmian and Episturmian Words. Developments in Language Theory 2013: 191-202 - [c5]Emilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni:
Self-shuffling Words. ICALP (2) 2013: 113-124 - [e1]Juhani Karhumäki, Arto Lepistö, Luca Q. Zamboni:
Combinatorics on Words - 9th International Conference, WORDS 2013, Turku, Finland, September 16-20. Proceedings. Lecture Notes in Computer Science 8079, Springer 2013, ISBN 978-3-642-40578-5 [contents] - [i15]Gabriele Fici, Luca Q. Zamboni:
On the least number of palindromes contained in an infinite word. CoRR abs/1301.3376 (2013) - [i14]Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni:
On a generalization of Abelian equivalence and complexity of infinite words. CoRR abs/1301.5104 (2013) - [i13]Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni:
A Coloring Problem for Sturmian and Episturmian Words. CoRR abs/1301.5263 (2013) - [i12]Emilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni:
Self-Shuffling Words. CoRR abs/1302.3844 (2013) - [i11]Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni:
A Coloring Problem for Infinite Words. CoRR abs/1307.2828 (2013) - [i10]Tero Harju, Mari Huova, Luca Q. Zamboni:
On Generating Binary Words Palindromically. CoRR abs/1309.1886 (2013) - 2012
- [j22]Michelangelo Bucci, Alessandro De Luca, Luca Q. Zamboni:
Some Characterizations of Sturmian Words in Terms of the Lexicographic Order. Fundam. Informaticae 116(1-4): 25-33 (2012) - [j21]Anna E. Frid, Luca Q. Zamboni:
On automatic infinite permutations. RAIRO Theor. Informatics Appl. 46(1): 77-85 (2012) - [i9]Michelangelo Bucci, Alessandro De Luca, Luca Q. Zamboni:
Some characterizations of Sturmian words in terms of the lexicographic order. CoRR abs/1205.5946 (2012) - [i8]Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
On minimal factorizations of words as products of palindromes. CoRR abs/1210.6179 (2012) - [i7]Michelangelo Bucci, Alessandro De Luca, Luca Q. Zamboni:
Reversible Christoffel factorizations. CoRR abs/1211.3049 (2012) - 2011
- [j20]Julien Cassaigne, Sébastien Ferenczi, Luca Q. Zamboni:
Combinatorial trees arising in the study of interval exchange transformations. Eur. J. Comb. 32(8): 1428-1444 (2011) - [j19]Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity. Int. J. Found. Comput. Sci. 22(4): 905-920 (2011) - [j18]Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Abelian complexity of minimal subshifts. J. Lond. Math. Soc. 83(1): 79-95 (2011) - [c4]Svetlana Puzynina, Luca Q. Zamboni:
Abelian returns in Sturmian words. WORDS 2011: 179-188 - [i6]Anna E. Frid, Luca Q. Zamboni:
On automatic infinite permutations. CoRR abs/1109.6131 (2011) - 2010
- [j17]Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Balance and Abelian complexity of the Tribonacci word. Adv. Appl. Math. 45(2): 212-231 (2010) - [j16]Aldo de Luca, Luca Q. Zamboni:
Involutions of epicentral words. Eur. J. Comb. 31(3): 867-886 (2010) - [j15]Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Standard factors of Sturmian words. RAIRO Theor. Informatics Appl. 44(1): 159-174 (2010) - [j14]Aldo de Luca, Luca Q. Zamboni:
On graphs of central episturmian words. Theor. Comput. Sci. 411(1): 70-90 (2010) - [i5]Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Avoiding Abelian powers in binary words with bounded Abelian complexity. CoRR abs/1005.2514 (2010)
2000 – 2009
- 2009
- [j13]Michelangelo Bucci, Alessandro De Luca, Amy Glen, Luca Q. Zamboni:
A connection between palindromic and factor complexity using return words. Adv. Appl. Math. 42(1): 60-74 (2009) - [j12]Michelangelo Bucci, Aldo de Luca, Alessandro De Luca, Luca Q. Zamboni:
On theta-episturmian words. Eur. J. Comb. 30(2): 473-479 (2009) - [j11]Amy Glen, Jacques Justin, Steve Widmer, Luca Q. Zamboni:
Palindromic richness. Eur. J. Comb. 30(2): 510-531 (2009) - [j10]Michelangelo Bucci, Alessandro De Luca, Amy Glen, Luca Q. Zamboni:
A new characteristic property of rich words. Theor. Comput. Sci. 410(30-32): 2860-2863 (2009) - [j9]Robert Tijdeman, Luca Q. Zamboni:
Fine and Wilf words for any periods II. Theor. Comput. Sci. 410(30-32): 3027-3034 (2009) - 2008
- [j8]Michelangelo Bucci, Aldo de Luca, Alessandro De Luca, Luca Q. Zamboni:
On some problems related to palindrome closure. RAIRO Theor. Informatics Appl. 42(4): 679-700 (2008) - [j7]Michelangelo Bucci, Aldo de Luca, Alessandro De Luca, Luca Q. Zamboni:
On different generalizations of episturmian words. Theor. Comput. Sci. 393(1-3): 23-36 (2008) - [j6]Aldo de Luca, Amy Glen, Luca Q. Zamboni:
Rich, Sturmian, and trapezoidal words. Theor. Comput. Sci. 407(1-3): 569-573 (2008) - [c3]Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni:
Relationally Periodic Sequences and Subword Complexity. Developments in Language Theory 2008: 196-205 - [i4]Amy Glen, Jacques Justin, Steve Widmer, Luca Q. Zamboni:
Palindromic Richness. CoRR abs/0801.1656 (2008) - [i3]Michelangelo Bucci, Alessandro De Luca, Amy Glen, Luca Q. Zamboni:
A connection between palindromic and factor complexity using return words. CoRR abs/0802.1332 (2008) - [i2]Aldo de Luca, Amy Glen, Luca Q. Zamboni:
Rich, Sturmian, and trapezoidal words. CoRR abs/0802.3885 (2008) - [i1]Michelangelo Bucci, Alessandro De Luca, Amy Glen, Luca Q. Zamboni:
A new characteristic property of rich words. CoRR abs/0807.2303 (2008) - 2007
- [c2]Marinella Sciortino, Luca Q. Zamboni:
Suffix Automata and Standard Sturmian Words. Developments in Language Theory 2007: 382-398 - 2004
- [j5]Oliver Jenkinson, Luca Q. Zamboni:
Characterisations of balanced words via orderings. Theor. Comput. Sci. 310(1-3): 247-271 (2004) - [j4]Anthony Quas, Luca Q. Zamboni:
Periodicity and local complexity. Theor. Comput. Sci. 319(1-3): 229-240 (2004) - [j3]Marcia Edson, Luca Q. Zamboni:
On representations of positive integers in the Fibonacci base. Theor. Comput. Sci. 326(1-3): 241-260 (2004) - 2002
- [j2]Filippo Mignosi, Luca Q. Zamboni:
A Note on a Conjecture of Duval and Sturmian Words. RAIRO Theor. Informatics Appl. 36(1): 1-3 (2002) - 2001
- [c1]Sébastien Ferenczi, Charles Holton, Luca Q. Zamboni:
Combinatorics of Three-Interval Exchanges. ICALP 2001: 567-578
1990 – 1999
- 1999
- [j1]Charles Holton, Luca Q. Zamboni:
Descendants of Primitive Substitutions. Theory Comput. Syst. 32(2): 133-157 (1999)
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-06-10 20:31 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:
