The following pages link to Aldo De Luca (Q1165590):
Displaying 50 items.
- (Q198197) (redirect page) (← links)
- (Q444408) (redirect page) (← links)
- A standard correspondence on epicentral words (Q444409) (← links)
- A division property of the Fibonacci word (Q672965) (← links)
- On the number of episturmian palindromes (Q708221) (← links)
- A generalized palindromization map in free monoids (Q714817) (← links)
- On Christoffel and standard words and their derivatives (Q728275) (← links)
- Synchronization and simplification (Q755320) (← links)
- A note on the Burnside problem for semigroups (Q759839) (← links)
- On finitely recognizable semigroups (Q811558) (← links)
- Farey codes and languages (Q854840) (← links)
- On some variations of coloring problems of infinite words (Q889516) (← links)
- On prefixal factorizations of words (Q896064) (← links)
- Non-repetitive words relative to a rewriting system (Q908710) (← links)
- Rich, Sturmian, and trapezoidal words (Q955036) (← links)
- Involutions of epicentral words (Q966143) (← links)
- On \(\theta\)-episturmian words (Q1003600) (← links)
- On graphs of central episturmian words (Q1041223) (← links)
- On the centers of a language (Q1054162) (← links)
- On the product of square-free words (Q1060021) (← links)
- Square-free words on partially commutative free monoids (Q1076163) (← links)
- Star-free sets of integers (Q1079381) (← links)
- A decision procedure on partially commutative free monoids (Q1086682) (← links)
- Test sets for languages of infinite words (Q1113683) (← links)
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups (Q1119694) (← links)
- Factorial languages whose growth function is quadratically upper bounded (Q1120288) (← links)
- On some properties of very pure codes (Q1133332) (← links)
- Minimal complete sets of words (Q1145771) (← links)
- A combinatorial property of the Fibonacci words (Q1156243) (← links)
- On some combinatorial problems in free monoids (Q1160130) (← links)
- A synchronization property of pure subsemigroups of a free semigroup (Q1165591) (← links)
- A finiteness condition for semigroups generalizing a theorem of Hotzel (Q1173706) (← links)
- Finiteness and iteration conditions for semigroups (Q1177143) (← links)
- On noncounting regular classes (Q1193624) (← links)
- On a conjecture of Brown (Q1206790) (← links)
- Closure operations on measures of computational complexity (Q1219561) (← links)
- A note on \(\omega\)-permutable semigroups (Q1262957) (← links)
- A conjecture on continued fractions (Q1275461) (← links)
- Words and repeated factors (Q1290727) (← links)
- On the combinatorics of finite words (Q1292479) (← links)
- On bispecial factors of the Thue-Morse word (Q1318735) (← links)
- Well quasi-orders and regular languages (Q1338899) (← links)
- A finiteness condition for semigroups generalizing a theorem of Coudrain and Schützenberger (Q1341145) (← links)
- Some combinatorial properties of Sturmian words (Q1349698) (← links)
- Sturmian words: structure, combinatorics, and their arithmetics (Q1391137) (← links)
- Sturmian words, Lyndon words and trees (Q1391533) (← links)
- Standard Sturmian morphisms (Q1391534) (← links)
- Special factors, periodicity, and an application to Sturmian words (Q1579056) (← links)
- Some combinatorial results on Bernoulli sets and codes (Q1605333) (← links)
- Words, univalent factors, and boxes (Q1608945) (← links)
