Options
On stochastic automata over monoids
Citation Link: https://doi.org/10.15480/882.3079
Publikationstyp
Preprint
Publikationsdatum
2020-02-04
Sprache
English
Institut
TORE-URI
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.
Schlagworte
Stochastic automaton
monoid
formal language
DDC Class
510: Mathematik
Loading...
Name
stochasticautomata.pdf
Size
235.33 KB
Format
Adobe PDF