Remarks on restricted Nevanlinna transforms

Remarks on Codes, Spectral Transforms, and Decision Diagrams

In this paper, we discuss definitions, features, and relationships of Reed-Muller transforms, Reed-Muller codes and their generalizations to multiple-valued cases, and Reed-Muller decision diagrams. The novelty in this primarily review paper resides in putting together these concepts in the same context and providing a uniform point of view to their definition in terms of a convolutionwise mult...

Lectures on Nevanlinna theory

Value distribution of a rational function f is controlled by its degree d, which is the number of preimages of a generic point. If we denote by n(a) the number of solutions of the equation f(z) = a, counting multiplicity, in the complex plane C, then n(a) ≤ d for all a ∈ C with equality for all a with one exception, namely a = f(∞). The number of critical points of f in C, counting multiplicity...

Remarks on Adult Languages of Propagating Systems with Restricted Parallelism

abstract Various rewriting mechanisms can be thought of as functions mapping words w to nite sets of words W. The adult language of (; !) is the set of words w which are xed points of , i.e. (w) = fwg, and reachable from a start word or axiom !, i.e. w 2 n (!) for some n 2 N 0. Interestingly, for systems without the table mechanism, the degree of parallelism does not aaect the generative capaci...

Nevanlinna on Analytic Functions

Integral Transforms of Functions with Restricted Derivatives