IMCS/Publications/BASM/Issues/BASM n.3 (37), 2001/

On the Complexity of Some Discrete Time Systems.

Authors: Orman Gabriel V.


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.