Abstract:
Probabilistic automata are represented as a Bernoulli generator and corresponding deterministic automaton in series. Necessary and sufficient conditions for loopless decomposition of probabilistic automata are found. If the decomposition in question holds for the deterministic part of the automaton.
Fulltext:
PDF file (1062 kB)