5 citations · 6 across the 5 of their papers we have counts for
Showing cs.FLShow 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…
cs.FL2018
Synchronizing Random Almost-Group Automata
Mikhail V. Berlinkov, Cyril Nicaud
In this paper we address the question of synchronizing random automata in the critical settings of almost-group automata. Group automata are automata where all letters act as permu…