Cyclic decomposition of finite stochastic systems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Loop-Free Decomposition of Stochastic Finite-State Systems

Two generalizations of Bacon's theory of loop-free decomposition of probabilistic finite-state systems are proposed. The first of these consists of a modification of the structure of the decomposition which then allows for the decomposition of a larger class of systems. The second generalization subsumes the first: sufficient conditions for a stochastic finite-state system to be decomposable fo...

متن کامل

Whirl Decomposition of Stochastic Systems

Using a technique based on "state splitting" it is shown that every n-state Markov system is decomposable into a whirl interconnection of n 1 two-state Markov systems.

متن کامل

Cyclic Decomposition of Permutations of Finite Fields Obtained Using Monomials

In this paper we study permutations of finite fields Fq that decompose as products of cycles of the same length, and are obtained using monomials x ∈ Fq[x]. We give the necessary and sufficient conditions on the exponent i to obtain such permutations. We also present formulas for counting the number of this type of permutations. An application to the construction of encoders for turbo codes is ...

متن کامل

Finite $p$-groups and centralizers of non-cyclic abelian subgroups

A $p$-group $G$ is called a $mathcal{CAC}$-$p$-group if $C_G(H)/H$ is ‎cyclic for every non-cyclic abelian subgroup $H$ in $G$ with $Hnleq‎ ‎Z(G)$‎. ‎In this paper‎, ‎we give a complete classification of‎ ‎finite $mathcal{CAC}$-$p$-groups‎.

متن کامل

Stochastic finite-state systems in control theory

This paper is concerned, in the main, with a problem of pursuit–evasion in the context of a stochastic finite-state system. Two cases are considered: (a) non-competitive pursuit in which the target does not try to evade the pursuer; and (b) a competitive case in which the aim of the target is to maximize the time of interception, and that of the pursuer is to minimize it. Employing dynamic prog...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1974

ISSN: 0022-0000

DOI: 10.1016/s0022-0000(74)80038-3