7 citations · 18 across the 7 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2014
Stability and Complexity of Minimising Probabilistic Automata
Stefan Kiefer, Björn Wachter
We consider the state-minimisation problem for weighted and probabilistic automata. We provide a numerically stable polynomial-time minimisation algorithm for weighted automata, wi…
cs.FL2012★ 3 cited
BPA Bisimilarity is EXPTIME-hard
Stefan Kiefer
Given a basic process algebra (BPA) and two stack symbols, the BPA bisimilarity problem asks whether the two stack symbols are bisimilar. We show that this problem is EXPTIME-hard.