# The Reduction of One Random Morphism to an *ε*-Deterministic One

Chapter

## Abstract

A deterministic morphism is a particular case of a random morphism. On the other hand a bijective deterministic morphism (bijection) with the source X and the ending X generates a random morphism with the source and respective ending equal to X/**R** where **R** is the equivalence relation. Therefore if we consider a bijection of the set X on itself (i.e. a special case of deterministic morphism) and we pass to a poorer set (the set of equivalence class with respect to a given equivalence relation on X i.e. a partition of X) then a random morphism is obtained.

## Keywords

Minimum Distance Shift Operator Rational Algorithm Hadamard Matrice Hadamard Matrix
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## Copyright information

© Springer-Verlag Wien 1971