scientific article

zbMATH Open0629.60014MaRDI QIDQ3766559

Tamás F. Móri

Publication date: 1987

Title of this publication is not available (Why is that?)

zbMATH Keywords

limit theoremsequence of random letters

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Maximal length of common words among random letter sequences 👍 👎
• Asymptotic independence of maximum waiting times for increasing alphabet 👍 👎
• Expected length of the longest common subsequence for large alphabets 👍 👎
• Finite repetition threshold for large alphabets 👍 👎
• On the Repetition Threshold for Large Alphabets 👍 👎
• LATIN 2004: Theoretical Informatics 👍 👎
• On expected waiting time until given words appear in random sequence 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3766559)