RO EN
On the Complexity of Some Discrete Time Systems.
Authors: Orman Gabriel V.
Abstract
From some time our interest was focused to find new possibilities for characterizing the process of generation of the words by generative systems. In our previous paper [5] and [6] we have introduced some numerical functions able to characterize classes of derivations according to a given generative system (as the phrase-structure grammars known in formal languages) up to an equivalence. They are referred to as “derivational functions”. Then the difference operator was defined and its properties of invariance have been studied. In this paper starting from this point we propose to determine the state probabilities of a stochastic automaton associated to the representation of an equivalence class involving the difference operator.E-mail:
Contents
- Lagrange and Hamilton spaces. Geometrical models in Mechanics.
- Intuitionistic fuzzy approach to BCC-algebras.
- On the Complexity of Some Discrete Time Systems.
- On the optimization of nonsmooth Kirchhoff-Love arches.
- Decompozitionnof some algebras with topologies and their Resolvability.
- The minimum-cost flow problem on dynamic networks and an algorithm for its solving.
- Symplectic connections in Lagrange geometry.
- On weighted functional spaces.
- Again on the direct sums of modules with the direct summand intersection property.
- A note on almost Hermitian manifolds with a J -invariant Ricci tensor.
- Generalized notion of differentiability.
- Convergence of collocation and quadratures methods for solving systems of nonlinear singular integral equations given on closed smooth contour.
- Fuzzy subfields.
