论文标题
在单体上的随机自动机上
On Stochastic Automata over Monoids
论文作者
论文摘要
研究输入集的随机自动机。这些自动机的定义明确定义需要扩展假设，以取代自由单体的固有通用特性。作为对土耳其烯结果的概括，将表明，单粒子上的广义自动机具有与随机对应物相同的接受能力。同态的关键是输入状态的单态同态和过渡矩阵的单体同态之间的通勤性质。研究了由随机自动机接受的语言的闭合性能。矩阵。研究了由随机自动机接受的语言的闭合性能。
Stochastic automata over monoids as input sets are studied. The well-definedness of these automata requires an extension postulate that replaces the inherent universal property of free monoids. As a generalization of Turakainen's result, it will be shown that the generalized automata over monoids have the same acceptance power as their stochastic counterparts. The key to homomorphisms is a commuting property between the monoid homomorphism of input states and the monoid homomorphism of transition matrices. Closure properties of the languages accepted by stochastic automata over monoids are investigated. matrices. Closure properties of the languages accepted by stochastic automata over monoids are investigated.
