Probabilistic B\"{u}chi Automata (\PBA) are randomized, finite state automata that process input strings of infinite length. Based on the threshold chosen for the acceptance probability, different classes of languages can ...