Björn Wachter

1. Stability and Complexity of Minimising Probabilistic Automata
   2014/04/26 by Stefan Kiefer, Björn Wachter, Kiefer, Stefan +1 · 1 citation
   Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Machine Learning and Algorithms #cs.FL #semigroups and automata theory
2. On the Complexity of the Equivalence Problem for Probabilistic Automata
   2011/12/20 by Stefan Kiefer, Andrzej S. Murawski, Kiefer, Stefan +7 · 1 citation
   Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #cs.FL