According to our database
1,
Luca Q. Zamboni
authored at least 59 papers
between 1999 and 2024.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2024
Clustering and Arnoux-Rauzy words.
Adv. Appl. Math., February, 2024
2023
Order Conditions for Languages.
Proceedings of the Combinatorics on Words - 14th International Conference, 2023
2021
On the extremal values of the cyclic continuants of Motzkin and Straus.
CoRR, 2021
Extremal values of semi-regular continuants and codings of interval exchange transformations.
CoRR, 2021
Continuants with Equal Values, a Combinatorial Approach.
Proceedings of the Combinatorics on Words - 13th International Conference, 2021
2020
Reprint of: <i>ω</i>-Lyndon words.
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
2019
Combining Extensions of the Hales-Jewett Theorem with Ramsey Theory in Other Structures.
Electron. J. Comb., 2019
Open and closed factors in Arnoux-Rauzy words.
Adv. Appl. Math., 2019
2018
Anti-powers in infinite words.
J. Comb. Theory, Ser. A, 2018
2017
Cyclic complexity of words.
J. Comb. Theory, Ser. A, 2017
A Taxonomy of Morphic Sequences.
CoRR, 2017
Variations of the Morse-Hedlund Theorem for <i>k</i>-Abelian Equivalence.
Acta Cybern., 2017
The sequence of open and closed prefixes of a Sturmian word.
Adv. Appl. Math., 2017
2016
On some variations of coloring problems of infinite words.
J. Comb. Theory, Ser. A, 2016
On prefixal factorizations of words.
Eur. J. Comb., 2016
Abelian bordered factors and periodicity.
Eur. J. Comb., 2016
Cost and dimension of words of zero topological entropy.
CoRR, 2016
2015
Theor. Comput. Sci., 2015
On generating binary words palindromically.
J. Comb. Theory, Ser. A, 2015
2014
A coloring problem for infinite words.
J. Comb. Theory, Ser. A, 2014
Infinite self-shuffling words.
J. Comb. Theory, Ser. A, 2014
Extremal words in morphic subshifts.
Discret. Math., 2014
Subword Complexity and Decomposition of the Set of Factors.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014
2013
On the least number of palindromes contained in an infinite word.
Theor. Comput. Sci., 2013
Reversible Christoffel factorizations.
Theor. Comput. Sci., 2013
On a generalization of Abelian equivalence and complexity of infinite words.
J. Comb. Theory, Ser. A, 2013
On additive properties of sets defined by the Thue-Morse word.
J. Comb. Theory, Ser. A, 2013
On palindromic factorization of words.
Adv. Appl. Math., 2013
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
A Coloring Problem for Sturmian and Episturmian Words.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013
2012
On automatic infinite permutations.
RAIRO Theor. Informatics Appl., 2012
Some Characterizations of Sturmian Words in Terms of the Lexicographic Order.
Fundam. Informaticae, 2012
On minimal factorizations of words as products of palindromes
CoRR, 2012
2011
Abelian complexity of minimal subshifts.
J. Lond. Math. Soc., 2011
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity.
Int. J. Found. Comput. Sci., 2011
Combinatorial trees arising in the study of interval exchange transformations.
Eur. J. Comb., 2011
Abelian returns in Sturmian words
Proceedings of the Proceedings 8th International Conference Words 2011, 2011
2010
On graphs of central episturmian words.
Theor. Comput. Sci., 2010
Standard factors of Sturmian words.
RAIRO Theor. Informatics Appl., 2010
Involutions of epicentral words.
Eur. J. Comb., 2010
Balance and Abelian complexity of the Tribonacci word.
Adv. Appl. Math., 2010
2009
Fine and Wilf words for any periods II.
Theor. Comput. Sci., 2009
A new characteristic property of rich words.
Theor. Comput. Sci., 2009
On theta-episturmian words.
Eur. J. Comb., 2009
A connection between palindromic and factor complexity using return words.
Adv. Appl. Math., 2009
2008
Rich, Sturmian, and trapezoidal words.
Theor. Comput. Sci., 2008
On different generalizations of episturmian words.
Theor. Comput. Sci., 2008
On some problems related to palindrome closure.
RAIRO Theor. Informatics Appl., 2008
Relationally Periodic Sequences and Subword Complexity.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008
2007
Suffix Automata and Standard Sturmian Words.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007
2004
Periodicity and local complexity.
Theor. Comput. Sci., 2004
Characterisations of balanced words via orderings.
Theor. Comput. Sci., 2004
On representations of positive integers in the Fibonacci base.
Theor. Comput. Sci., 2004
2002
A Note on a Conjecture of Duval and Sturmian Words.
RAIRO Theor. Informatics Appl., 2002
2001
Combinatorics of Three-Interval Exchanges.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
1999
Descendants of Primitive Substitutions.
Theory Comput. Syst., 1999
