Skip to Main content Skip to Navigation
Reports

Random Grammars

Abstract : 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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073502
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 1:04:35 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:48:19 PM

Identifiers

  • HAL Id : inria-00073502, version 1

Collections

Citation

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

Share

Metrics

Record views

109

Files downloads

180