Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: embeddability problem

Sortuj według:

Ogranicz wyniki do:

On the alternative structures for a three-grade Markov manpower system

Amenaghawon Vincent A., Ekhosuehi Virtue U., Osagiede Augustine A.

Journal of Mathematics and Applications

2020

Vol. 43

5--17

This paper considers a manpower system modelled within the Markov chain context under the condition that recruitment is doneto replace outgoing flows. The paper takes up the embeddability problem in a three-grade manpower system and examines it from the standpoint of generating function (i.e., the z-transform of stochastic matrices). The method constructs a stochastic matrix that is made up of a limiting-state probability matrix and a partial sum of transient matrices. Examples areprovided to illustrate the utility of the method.

Applying term rewriting to partial algebra theory

Dojer N.

Fundamenta Informaticae

2004

Vol. 63, nr 4

375--384

In our paper we apply term rewriting to decidability of equations in classes of partial algebras, as well as to embeddability of partial algebras into classes of total ones. We follow the approach to partial algebras introduced by H.-J. Kreowski in [13], in which (classes of) partial algebras are described by means of (classes of) total ones.