Cakir, Merve NurMerve NurCakirSaleemi, MehwishMehwishSaleemiZimmermann, Karl-HeinzKarl-HeinzZimmermann2022-03-212022-03-212021WSEAS Transactions on Information Science and Applications 18 : 34-38 (2021)http://hdl.handle.net/11420/12048Semiautomata 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 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.en1790-083220213438Birkhoff-von NeumannMonoidSemiautomatonStochastic automatonJournal Article10.37394/23209.2021.18.6Other