2 papers
cs.FL2025
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.FL2025
Random Deterministic Automata With One Added Transition
Arnaud Carayol, Philippe Duchon, Florent Koechlin +1
Every language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the number of states, which…