RANDOM GRAMMARS AND GRAPH GRAMMARS

          V.A. Malyshev, INRIA, Frankrike


A new class of concrete stochastic processes is defined
embracing all known classes of processes such as branching
processes, queuing systems, fractals and processes with a
local interaction. This class of processes is based on central
notions of computer science: grammar and graph grammar. It
also has strong connections with modern mathematical physics.
Main results concern thermodynamic limit for such processes.
Only basic knowledge of stochastic processes is assumed.