12 citations · 12 across the 5 of their papers we have counts for
14 papers
On Rational Recursive Sequences
Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki +1
We study the class of rational recursive sequences (ratrec) over the rational numbers. A ratrec sequence is defined via a system of sequences using mutually recursive equations of…
The boundedness and zero isolation problems for weighted automata over nonnegative rationals
Wojciech Czerwiński, Engel Lefaucheux, Filip Mazowiecki +2
We consider linear cost-register automata (equivalent to weighted automata) over the semiring of nonnegative rationals, which generalise probabilistic automata. The two problems of…
The complexity of soundness in workflow nets
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
Workflow nets are a popular variant of Petri nets that allow for algorithmic formal analysis of business processes. The central decision problems concerning workflow nets deal with…
Continuous One-Counter Automata
Michael Blondin, Tim Leys, Filip Mazowiecki +2
We study the reachability problem for continuous one-counter automata, COCA for short. In such automata, transitions are guarded by upper and lower bound tests against the counter…
Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework
Floris Geerts, Filip Mazowiecki, Guillermo A. Pérez
In this paper we cast neural networks defined on graphs as message-passing neural networks (MPNNs) in order to study the distinguishing power of different classes of such models. W…
On polynomial recursive sequences
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman +2
We study the expressive power of polynomial recursive sequences, a nonlinear extension of the well-known class of linear recursive sequences. These sequences arise naturally in the…