Open AccessOn the Decomposition of Generalized Semiautomata
Author(s) -
Merve Nur Cakir,
Mehwish Saleemi,
Karl-Heinz Zimmermann
Publication year - 2021
Publication title -
wseas transactions on information science and applications
Language(s) - English
Resource type - Journals
eISSN - 2224-3402
pISSN - 1790-0832
DOI - 10.37394/23209.2021.18.6
Subject(s) - von neumann architecture , product (mathematics) , decomposition , mathematics , state (computer science) , computer science , discrete mathematics , pure mathematics , algorithm , ecology , geometry , biology
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.