Results 1  10
of
219
Synchronization and linearity: an algebra for discrete event systems
, 2001
"... The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific ..."
Abstract

Cited by 250 (10 self)
 Add to MetaCart
The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific community. Copyright Statement This electronic document is in PDF format. One needs Acrobat Reader (available freely for most platforms from the Adobe web site) to benefit from the full interactive machinery: using the package hyperref by Sebastian Rahtz, the table of contents and all LATEX crossreferences are automatically converted into clickable hyperlinks, bookmarks are generated automatically, etc.. So, do not hesitate to click on references to equation or section numbers, on items of thetableofcontents and of the index, etc.. One may freely use and print this document for one’s own purpose or even distribute it freely, but not commercially, provided it is distributed in its entirety and without modifications, including this preface and copyright statement. Any use of thecontents should be acknowledged according to the standard scientific practice. The
The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms
 Russian Math. Surveys
, 1970
"... In 1964 Kolmogorov introduced the concept of the complexity of a finite object (for instance, the words in a certain alphabet). He defined complexity as the minimum number of binary signs containing all the information about a given object that are sufficient for its recovery (decoding). This defini ..."
Abstract

Cited by 189 (1 self)
 Add to MetaCart
In 1964 Kolmogorov introduced the concept of the complexity of a finite object (for instance, the words in a certain alphabet). He defined complexity as the minimum number of binary signs containing all the information about a given object that are sufficient for its recovery (decoding). This definition depends essentially on the method of decoding. However, by means of the general theory of algorithms, Kolmogorov was able to give an invariant (universal) definition of complexity. Related concepts were investigated by Solotionoff (U.S.A.) and Markov. Using the concept of complexity, Kolmogorov gave definitions of the quantity of information in finite objects and of the concept of a random sequence (which was then defined more precisely by MartinLof). Afterwards, this circle of questions developed rapidly. In particular, an interesting development took place of the ideas of Markov on the application of the concept of complexity to the study of quantitative questions in the theory of algorithms. The present article is a survey of the fundamental results connected with the brief remarks above.
Dimension in Complexity Classes
 SIAM Journal on Computing
, 2000
"... A theory of resourcebounded dimension is developed using gales, which are natural generalizations of martingales. When the resource bound (a parameter of the theory) is unrestricted, the resulting dimension is precisely the classical Hausdorff dimension (sometimes called "fractal dimension"). Othe ..."
Abstract

Cited by 113 (17 self)
 Add to MetaCart
A theory of resourcebounded dimension is developed using gales, which are natural generalizations of martingales. When the resource bound (a parameter of the theory) is unrestricted, the resulting dimension is precisely the classical Hausdorff dimension (sometimes called "fractal dimension"). Other choices of the parameter yield internal dimension theories in E, E 2 , ESPACE, and other complexity classes, and in the class of all decidable problems. In general, if C is such a class, then every set X of languages has a dimension in C, which is a real number dim(X j C) 2 [0; 1]. Along with the elements of this theory, two preliminary applications are presented: 1. For every real number 0 1 2 , the set FREQ( ), consisting of all languages that asymptotically contain at most of all strings, has dimension H()  the binary entropy of  in E and in E 2 . 2. For every real number 0 1, the set SIZE( 2 n n ), consisting of all languages decidable by Boolean circuits of at most 2 n n gates, has dimension in ESPACE.
The Dimensions of Individual Strings and Sequences
 INFORMATION AND COMPUTATION
, 2003
"... A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the theory of individual random sequences. This constructive dimension is used to assign every individual (infinite, binary ..."
Abstract

Cited by 93 (10 self)
 Add to MetaCart
A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the theory of individual random sequences. This constructive dimension is used to assign every individual (infinite, binary) sequence S a dimension, which is a real number dim(S) in the interval [0, 1]. Sequences that
Kolmogorov Complexity and Hausdorff Dimension
 Inform. and Comput
, 1989
"... this paper we are mainly interested in the first order approximation (i.e. the linear growth) of K(fi=\Delta). We consider the functions ..."
Abstract

Cited by 67 (20 self)
 Add to MetaCart
this paper we are mainly interested in the first order approximation (i.e. the linear growth) of K(fi=\Delta). We consider the functions
A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
 SIAM J. Computing
, 1996
"... Suffix trees find several applications in computer science and telecommunications, most notably in algorithms on strings, data compressions and codes. Despite this, very little is known about their typical behaviors. In a probabilistic framework, we consider a family of suffix trees  further calle ..."
Abstract

Cited by 52 (29 self)
 Add to MetaCart
Suffix trees find several applications in computer science and telecommunications, most notably in algorithms on strings, data compressions and codes. Despite this, very little is known about their typical behaviors. In a probabilistic framework, we consider a family of suffix trees  further called bsuffix trees  built from the first n suffixes of a random word. In this family a noncompact suffix tree (i.e., such that every edge is labeled by a single symbol) is represented by b = 1, and a compact suffix tree (i.e., without unary nodes) is asymptotically equivalent to b ! 1 as n ! 1. We study several parameters of bsuffix trees, namely: the depth of a given suffix, the depth of insertion, the height and the shortest feasible path. Some new results concerning typical (i.e., almost sure) behaviors of these parameters are established. These findings are used to obtain several insights into certain algorithms on words, molecular biology and universal data compression schemes. Key Wo...
Positivity Of Entropy Production In Nonequilibrium Statistical Mechanics.
 J. Stat. Phys
, 1996
"... . We analyze different mechanisms of entropy production in statistical mechanics, and propose formulae for the entropy production rate e(¯) in a state ¯. When ¯ is a steady state describing the long term behavior of a system we show that e(¯) 0, and sometimes we can prove e(¯) ? 0. Key words and p ..."
Abstract

Cited by 51 (1 self)
 Add to MetaCart
. We analyze different mechanisms of entropy production in statistical mechanics, and propose formulae for the entropy production rate e(¯) in a state ¯. When ¯ is a steady state describing the long term behavior of a system we show that e(¯) 0, and sometimes we can prove e(¯) ? 0. Key words and phrases: ensemble, entropy production, folding entropy, nonequilibrium stationary state, nonequilibrium statistical mechanics, SRB state, thermostat. * IHES (91440 Bures sur Yvette, France), and Math. Dept., Rutgers University (New Brunswick, NJ 08903, USA). 0. Introduction. The study of nonequilibrium statistical mechanics leads naturally to the introduction of nonequilibrium states. These are probability measures ¯ on the phase space of the system, suitably chosen and stationary (in principle) under the nonequilibrium time evolution. In the present paper we analyze the entropy production e(¯) for such nonequilibrium states, and show that it is positive (more precisely 0, sometimes one ca...
Asymptotic Properties Of Data Compression And Suffix Trees
 IEEE Trans. Inform. Theory
, 1993
"... Recently, Wyner and Ziv have proved that the typical length of a repeated subword found within the first n positions of a stationary ergodic sequence is (1=h) log n in probability where h is the entropy of the alphabet. This finding was used to obtain several insights into certain universal data com ..."
Abstract

Cited by 40 (11 self)
 Add to MetaCart
Recently, Wyner and Ziv have proved that the typical length of a repeated subword found within the first n positions of a stationary ergodic sequence is (1=h) log n in probability where h is the entropy of the alphabet. This finding was used to obtain several insights into certain universal data compression schemes, most notably the LempelZiv data compression algorithm. Wyner and Ziv have also conjectured that their result can be extended to a stronger almost sure convergence. In this paper, we settle this conjecture in the negative in the so called right domain asymptotic, that is, during a dynamic phase of expanding the data base. We prove  under an additional assumption involving mixing conditions  that the length of a typical repeated subword oscillates almost surely (a.s.) between (1=h 1 ) log n and (1=h 2 ) log n where 0 ! h 2 ! h h 1 ! 1. We also show that the length of the nth block in the LempelZiv parsing algorithm reveals a similar behavior. We relate our findings to...
Ergodic Theory on GaltonWatson Trees: Speed of Random Walk and Dimension of Harmonic Measure
 Systems
, 1994
"... . We consider simple random walk on the family tree T of a nondegenerate supercritical GaltonWatson branching process and show that the resulting harmonic measure has a.s. strictly smaller Hausdorff dimension than that of the whole boundary of T . Concretely, this implies that an exponentially smal ..."
Abstract

Cited by 40 (12 self)
 Add to MetaCart
. We consider simple random walk on the family tree T of a nondegenerate supercritical GaltonWatson branching process and show that the resulting harmonic measure has a.s. strictly smaller Hausdorff dimension than that of the whole boundary of T . Concretely, this implies that an exponentially small fraction of the nth level of T carries most of the harmonic measure. First order asymptotics for the rate of escape, Green function and the Avez entropy of the random walk are also determined. Ergodic theory of the shift on the space of random walk paths on trees is the main tool; the key observation is that iterating the transformation induced from this shift to the subset of "exit points" yields a nonintersecting path sampled from harmonic measure. x1. Introduction. Consider a supercritical GaltonWatson branching process with generating function f(s) = P 1 k=0 p k s k , i.e., each individual has k offspring with probability p k , and m := f 0 (1) ? 1. Started with a single prog...