首页|On the Decomposition of Generalized Semiautomata

On the Decomposition of Generalized Semiautomata

扫码查看
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.

SemiautomatonStochastic automatonMonoidBirkhoff-von neumann

MERVE NUR CAKIR、MEHWISH SALEEMI、KARL-HEINZ ZIMMERMANN

展开 >

Department of Computer Engineering Hamburg University of Technology

2021

WSEAS Transactions on Information Science and Applications

WSEAS Transactions on Information Science and Applications

ISSN:1790-0832
年,卷(期):2021.18