Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.3079
Fulltext available Open Access
arXiv ID: 2002.01214v1
Title: On stochastic automata over monoids
Language: English
Authors: Cakir, Merve Nur  
Zimmermann, Karl-Heinz 
Keywords: Stochastic automaton;monoid;formal language
Issue Date: 4-Feb-2020
Abstract (english): 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.
URI: http://hdl.handle.net/11420/7860
DOI: 10.15480/882.3079
Institute: Eingebettete Systeme E-13 
Type: Preprint (Vorabdruck)
License: In Copyright In Copyright
Appears in Collections:Publications with fulltext

Files in This Item:
File Description SizeFormat
stochasticautomata.pdf235,33 kBAdobe PDFThumbnail
View/Open
Show full item record

Page view(s)

39
Last Week
8
Last month
checked on Dec 3, 2020

Download(s)

14
checked on Dec 3, 2020

Google ScholarTM

Check

Note about this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.