Please use this identifier to cite or link to this item:
Fulltext available Open Access
arXiv ID: 2004.08805v1
Title: On the decomposition of generalized semiautomata
Language: English
Authors: Cakir, Merve Nur  
Zimmermann, Karl-Heinz 
Keywords: Semiautomaton;Birkhoffvon Neumann;Computer Science - Discrete Mathematics
Issue Date: 19-Apr-2020
Abstract (english): Semi-automata are abstractions of electronic devices that are deterministic finite-state machines having inputs but no outputs. Generalized semiautomata are obtained from stochastic semiautomata by dropping the restrictions imposed by probability. It is well-known that each stochastic semiautomaton can be decomposed into a sequential product of a dependent source and a deterministic semiautomaton making partly use of the celebrated theorem of Birkhoff-von Neumann. It will be shown that each generalized semiautomaton can be partitioned into a sequential product of a generalized dependent source and a deterministic semiautomaton.
DOI: 10.15480/882.3078
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
decomposition.pdf125,84 kBAdobe PDFThumbnail
Show full item record

Page view(s)

Last Week
Last month
checked on Dec 2, 2020


checked on Dec 2, 2020

Google ScholarTM


Note about this record


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