<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Lazari, A.A.</creatorName>
<affiliation>Universitatea de Stat din Moldova, Moldova, Republica</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='ro'>Caracteristicile probabilistice ale timpului de evoluţie al sistemelor aleatoare discrete
</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2009</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1857-2073</relatedIdentifier>
<dates>
<date dateType='Issued'>2009-04-01</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'>In this article it is being studied a class of random discrete systems, developing polynomial algorithms for determining the basic characteristics of time evolution of their own. It is a generalized problem for the case when the transfer time of the system in the next state is also a random variable with known distribution law. The developed algorithms are based on probabilistic method of determining the characteristics of random variables, knowing the generating function or characte-ristic function of them. Algorithms are being presented for numerical derivation of functions composed and rational fractions that appear later in main algorithms. It makes a brief foray into the theory of homogeneous linear recurring series to argue theoretically developed algorithms.</description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>