Computer Science – Formal Languages and Automata Theory
Scientist
Computer Science
Formal Languages and Automata Theory
Scientist
Universite de Lyon, France, and University of Turku, Finland
UNT Denton
A connection between palindromic and factor complexity using return words
A new characteristic property of rich words
Abelian Complexity in Minimal Subshifts
Abelian Properties of Words (Extended abstract)
Abelian returns in Sturmian words
No associations
LandOfFree
Luca Q. Zamboni does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Luca Q. Zamboni, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Luca Q. Zamboni will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-210512