1 citations · 1 across the 1 of their papers we have counts for
4 papers
Decomposing Permutation Automata
Ismaël Jecker, Nicolas Mazzocchi, Petra Wolf
A deterministic finite automaton (DFA) is composite if its language can be decomposed into an intersection of languages of smaller DFAs. Otherwise, A is prime. This notion of prima…
Two-way Parikh Automata
Emmanuel Filiot, Shibashis Guha, Nicolas Mazzocchi
Parikh automata extend automata with counters whose values can only be tested at the end of the computation, with respect to membership into a semi-linear set. Parikh automata have…
A Pattern Logic for Automata with Outputs
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the o…
Decidable Weighted Expressions with Presburger Combinators
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
In this paper, we investigate the expressive power and the algorithmic properties of weighted expressions, which define functions from finite words to integers. First, we consider…