Options
On the Decomposition of Generalized Semiautomata
Publikationstyp
Journal Article
Date Issued
2021
Sprache
English
Author(s)
Institut
Volume
18
Start Page
34
End Page
38
Citation
WSEAS Transactions on Information Science and Applications 18 : 34-38 (2021)
Publisher DOI
Scopus ID
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.
Subjects
Birkhoff-von Neumann
Monoid
Semiautomaton
Stochastic automaton