On the Decomposition of Generalized Semiautomata
2021 ◽
Vol 18
◽
pp. 34-38
Keyword(s):
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.
2010 ◽
Vol 46
(1)
◽
pp. 1-6
◽
Keyword(s):