作者: Benedikt Bollig , Paul Gastin , Benjamin Monmege , Marc Zeitoun
DOI: 10.1007/978-3-642-33386-6_31
关键词: Probabilistic CTL 、 Quantum finite automata 、 Probabilistic automaton 、 Probabilistic argumentation 、 Probabilistic logic 、 Automata theory 、 Probabilistic analysis of algorithms 、 Mathematics 、 Discrete mathematics 、 Nested word
摘要: We provide a Kleene Theorem for (Rabin) probabilistic automata over finite words. Probabilistic generalize deterministic and assign to word an acceptance probability. expressions with choice, guarded concatenation, star operator. prove that are expressively equivalent. Our result actually extends two-way pebbles corresponding expressions.