Pierre Popoli

Orcid: 0000-0002-4243-9180

According to our database1, Pierre Popoli authored at least 9 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
State Complexity of Shifts of the Fibonacci Word.
CoRR, March, 2026

Factor-balancedness, linear recurrence, and factor complexity.
CoRR, February, 2026

2025
Computing Expansions in Infinitely Many Cantor Real Bases via a Single Transducer.
CoRR, July, 2025

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences.
CoRR, April, 2025

2024
Combinatorics on Social Configurations.
Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, 2024

On the Pseudorandomness of Parry-Bertrand Automatic Sequences.
Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

Additive Word Complexity and Walnut.
Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023
On the binary digits of <i>n</i> and <i>n</i><sup>2</sup>.
Theor. Comput. Sci., 2023

2021
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences.
Cryptogr. Commun., 2021


  Loading...