Cakir, Merve NurMerve NurCakirZimmermann, Karl-HeinzKarl-HeinzZimmermann2020-11-192020-11-192020-04-19arXiv: 2004.08805v1 (2020)http://hdl.handle.net/11420/7859Semi-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.enhttp://rightsstatements.org/vocab/InC/1.0/SemiautomatonBirkhoffvon NeumannComputer Science - Discrete MathematicsInformatikPreprint10.15480/882.307810.15480/882.30782004.08805v1Preprint