113 citations · 260 across the 57 of their papers we have counts for
5 papers · 1 filter
Transcendence of Sturmian Numbers over an Algebraic Base
Florian Luca, Joel Ouaknine, James Worrell
We consider numbers of the form for a Sturmian sequence over a binary alp…
Termination of Linear Loops over the Integers
Mehran Hosseini, Joël Ouaknine, James Worrell
We consider the problem of deciding termination of single-path while loops with integer variables, affine updates, and affine guard conditions. The question is whether such a loop…
Convex Language Semantics for Nondeterministic Probabilistic Automata
Gerco van Heerdt, Justin Hsu, Joël Ouaknine +1
We explore language semantics for automata combining probabilistic and nondeterministic behavior. We first show that there are precisely two natural semantics for probabilistic aut…
On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Stefan Kiefer, Andrzej Murawski, Joel Ouaknine +2
This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational numbers. We use polynomial…
On the Complexity of the Equivalence Problem for Probabilistic Automata
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine +2
Checking two probabilistic automata for equivalence has been shown to be a key problem for efficiently establishing various behavioural and anonymity properties of probabilistic sy…