Decomposition Theorems for Probabilistic Automata over Infinite Objects
Volume 10, Issue 4 (1999), pp. 427–440
Pub. online: 1 January 1999
Type: Research Article
Received
1 October 1999
1 October 1999
Published
1 January 1999
1 January 1999
Abstract
A probabilistic Büchi automaton PBA is defined. The probabilistic language (L, p) as defined by the PBA is defined. A decomposition theorem similar to the classical Krohn-Rhodes theorem, but for PBA is proved.