RO EN
Waiting for an ape to type a poem. (English)
Authors: Zbaganu G.
Abstract
An ape plays witha type machine. He has no memory, but he may like some letters more than other ones. How much do we have to wait untill he types a given text. The problem was principially solved by Li and by Guibas and Odlyzko. We give a reccurence formulla for the distribution of the waiting time and prove that its dispersion is smaller than its expectation.Contents
- On polytopes with regular faces in the Lobachesvkij space. (Russian)
- On the cardinality of formula bases and absence of finite approximation with respect to completeness in propositional provability logic. (Russian)
- Description of classically complete chain systems of pseudo-Boolean functions. (Russian)
- Fibre partitions of the Lobachevskij space by limit regular polytopes. (Russian)
- Regular and strongly regular rings with respect to a right ideal. (Russian)
- On a property of groups of type $G^\#$. (Russian)
- Nilpotent linear extensions of minimal groups of transformations. (Russian)
- Topological classification of quadratic systems with a unique third-order singular point. (English)
- On the extension of a pseudonorm of a ring to its field of quotients. (Russian)
- On a family of generalized Hermitian splines. (Russian)
- Waiting for an ape to type a poem. (English)
- Lattices of submodules and Galois connections. (English)
- Centre and multiplication groups of quasigroups. (English)
- Finite projection, reversibility and queueing systems. (English)
