Determinacy of probabilistic ω-languages with strict threshold semantics (New frontiers of proof and computation)
Li, Wenjuan, Tanaka, Kazuyuki · Institutional Repositories DataBase (IRDB) · 2024
Probabilistic automata are a natural generalization of non-deterministic finite automata in the sense of replacing the non-determinism with probabilistic distributions as introduced by Rabin (1963). In this paper, we review several kinds of probabilistic automata on ω-languages and introduce our results of the determinacy strength of some probabilistic ω-languages with threshold semantics.