[176804]
Title: Stochastic Automata over Monoids.
Written by: Merve Cakir and Karl-Heinz Zimmermann
in: <em>arXiv</em>. January (2020).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series: https://arxiv.org/pdf/2002.01214.pdf
Address:
Edition:
ISBN:
how published: CaZi20a
Organization:
School:
Institution:
Type:
DOI:
URL:
ARXIVID:
PMID:

[BibTex]

Note: khzimmermann, AEG

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.