2 results
Vojtěch Forejt ; Petr Jančar ; Stefan Kiefer ; James Worrell.
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata (without epsilon-transitions). We first show a general […]
Published on November 15, 2018
Dmitry Chistikov ; Stefan Kiefer ; Andrzej S. Murawski ; David Purser.
Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater than some constant multiple of the weight in the second. We show that the problem is undecidable, even for the instantiation of weighted […]
Published on March 15, 2022