Abstract: Semiautomata 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
Merve Nur Cakir, Mehwish Saleemi, Karl-Heinz Zimmermann, "On the Decomposition of Generalized Semiautomata," WSEAS Transactions on Information Science and Applications, vol. 18, pp. 34-38, 2021, DOI:10.37394/23209.2021.18.6
Merve Nur Cakir, Mehwish Saleemi, Karl-Heinz Zimmermann. On the Decomposition of Generalized Semiautomata.
WSEAS Transactions on Information Science and Applications. 2021;18:34-38. 10.37394/23209.2021.18.6