5 citations · 6 across the 8 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.FL2025★ 5 cited
Weakly-unambiguous Parikh automata and their link to holonomic series
Alin Bostan, Arnaud Carayol, Florent Koechlin +1
We investigate the connection between properties of formal languages and properties of their generating series, with a focus on the class of holonomic power series. We first prove…
math.GR2025
The average-case complexity of the Word Problem for groups of matrices over is linear
Frédérique Bassino, Cyril Nicaud, Pascal Weil
We show that the Word Problem in finitely generated subgroups of can be solved in linear average-case complexity. This is done under the bit-complexity…