Random Grammars - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1997

Random Grammars


This is the first part in a series of papers, where we consider new connections between computer science and modern mathematical physics. Here we begin to study a class of "concrete" random processes covering most of well known processes, such as locally interacting processes, random fractals, random walks, queueing networks, random Turing machines, etc. Here we restrict ourselves to linear graphs. We establish existence and uniqueness of the dynamics in the thermodynamic limit and prove that this dynamics is clustering. We get ergodicity and non-recurrence conditions in a small perturbation region. We study invariant measures and large time fractal type behaviour for random context free grammars and languages.
Fichier principal
Vignette du fichier
RR-3187.pdf (350.34 Ko) Télécharger le fichier

Dates and versions

inria-00073502 , version 1 (24-05-2006)


  • HAL Id : inria-00073502 , version 1


Vadim A. A. Malyshev. Random Grammars. [Research Report] RR-3187, INRIA. 1997. ⟨inria-00073502⟩
43 View
112 Download


Gmail Facebook Twitter LinkedIn More