Pub. online:1 Jan 1999Type:Research ArticleOpen Access
Volume 10, Issue 4 (1999), pp. 427–440
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.