Submitted: September 2013
Abstract
In this thesis we study the probabilistic automaton (PA) model. In particular, we are interested in the notion of weak transitions. We introduce ond analyze three definitions of this type of transition, each of which has appeared in earlier literature. In the main part of this thesis we prove that those definitions are equivalent. For the purpose of showing this claim we provide 3 constructive proofs demonstrating in detail how each instance of a definition can be mapped to an instance of the respective other definition.