@article{CaZi20a,
Author = {Merve Cakir and Karl-Heinz Zimmermann},
Title = {Stochastic Automata over Monoids.},
Journal = {<em>arXiv</em>.},
Year = {(2020).},
Month = {January},
Note = {khzimmermann, AEG},
Series = {https://arxiv.org/pdf/2002.01214.pdf},
Howpublished = {CaZi20a},
Abstract = {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 the input states and the monoid homomorphism of transition matrices. Closure properties of the languages accepted by stochastic automata over monoids are investigated.}
}

@COMMENT{Bibtex file generated on 2026-5-15 with typo3 si_bibtex plugin. Data from https://www.tuhh.de/es/home/publications }