Cover Image

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Couvreur, Jean-Michel, Delacourt, Martin, Ollinger, Nicolas, Popoli, Pierre, Shallit, Jeffrey, Stipulanti, Manon
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory Discrete Mathematics Combinatorics 11B85, 68R15, 68Q45
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The reflection complexity of sequences over finite alphabets
by: Allouche, Jean-Paul, et al.
Published: (2024)

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
by: Hendel, Russell Jay
Published: (2025)

Positionality of Dumont--Thomas numeration systems for integers
by: Kreczman, Savinien, et al.
Published: (2025)

Dissecting power of intersection of two context-free languages
by: Rukavicka, Josef
Published: (2020)

Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
by: Carton, Olivier, et al.
Published: (2024)

The Repetition Threshold for Rote Sequences
by: Ollinger, Nicolas, et al.
Published: (2024)

Combinatorics on words and generating Dirichlet series of automatic sequences
by: Allouche, Jean-Paul, et al.
Published: (2024)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)

Mahler equations for Zeckendorf numeration
by: Carton, Olivier, et al.
Published: (2024)

Bandwidth of Nondeterministic Finite Automata
by: Cho, Da-Jung, et al.
Published: (2026)

Semidirect Product Decompositions for Periodic Regular Languages
by: Inoue, Yusuke, et al.
Published: (2024)

A hierarchy of reversible finite automata
by: Radionova, Maria, et al.
Published: (2024)

On Computational Completeness of Semi-Conditional Matrix Grammars
by: Fernau, Henning, et al.
Published: (2024)

Nondeterministic tree-walking automata are not closed under complementation
by: Martynova, Olga, et al.
Published: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
by: Petrov, Semyon, et al.
Published: (2024)

Mostowski Index via extended register games
by: Idir, Olivier, et al.
Published: (2024)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
by: Laumen, Jasper, et al.
Published: (2026)

From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
by: Martynova, Olga, et al.
Published: (2025)

Bounded Languages Described by GF(2)-grammars
by: Makarov, Vladislav
Published: (2019)

Linear equations and recursively enumerable sets
by: Honkala, Juha
Published: (2024)

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
by: Zhu, Yinfeng
Published: (2024)

Around Don's conjecture for binary completely reachable automata
by: Zhu, Yinfeng
Published: (2024)

Don's conjecture for binary completely reachable automata: an approach and its limitations
by: Casas, David, et al.
Published: (2023)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
by: Yordzhev, Krasimir
Published: (2026)

Presheaf automata
by: Struth, Georg, et al.
Published: (2024)

Automatic Abelian Complexities of Parikh-Collinear Fixed Points
by: Rigo, Michel, et al.
Published: (2024)

The Algebra of Nondeterministic Finite Automata
by: Gorrieri, Roberto
Published: (2023)

A generalization of Deterministic Finite Automata related to discharging
by: Campbell, John M.
Published: (2025)

On Quantum Context-Free Grammars
by: Aruja, Merina, et al.
Published: (2025)

Additive word complexity and Walnut
by: Popoli, Pierre, et al.
Published: (2024)

State Complexity of Shifts of the Fibonacci Word
by: Moradi, Delaram, et al.
Published: (2026)

Illustrating Finite Automata with Grail+ and TikZ
by: May, Alastair, et al.
Published: (2024)

Decomposition of Automata recognizing Ideals
by: Berry, Mathias, et al.
Published: (2026)

A polynomial-time algorithm for the automatic Baire property
by: Staiger, Ludwig
Published: (2025)

On Languages Describing Large Graph Classes
by: Fernau, Henning, et al.
Published: (2026)

A note on Automatic Baire property
by: Staiger, Ludwig
Published: (2025)

Weakly-unambiguous Parikh automata and their link to holonomic series
by: Bostan, Alin, et al.
Published: (2025)

The speed of convergence in greedy Galois games
by: Shallit, Jeffrey
Published: (2026)

Symbols frequencies in the Thue--Morse word in base $3/2$ and related conjectures
by: Cassaigne, Julien, et al.
Published: (2026)

Practical Livelock Analysis in Parameterized Unidirectional Rings
by: Farahat, Aly
Published: (2026)