Skip to Main content Skip to Navigation
Reports

Interacting Strings of Characters

Abstract : We consider several interacting strings of characters. Otherwise speaking, we consider one-dimensional random walks interacting with each other and with their environments (mostly in a one-sided manner). This embraces many applications: queueing networks with different customer types, random walks on some discrete non-commutative groups, random Turing machines and others. We present a scheme for the general theory of such processes, the general theory of random walks in the orthant being a particular case. This scheme is being developed in several papers, a review of which is presented here.
Document type :
Reports
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

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

Identifiers

  • HAL Id : inria-00073635, version 1

Collections

Citation

Vadim A. Malyshev. Interacting Strings of Characters. [Research Report] RR-3057, INRIA. 1996. ⟨inria-00073635⟩

Share

Metrics

Record views

110

Files downloads

92