No label defined (Q4723318)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3997184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3997184 |
Statements
1986
0 references
formal language
0 references
Bernoullian density
0 references
conditional waiting time
0 references
Goldstine's language
0 references
palindromes
0 references
0.7898509502410889
0 references
0.7774154543876648
0 references
0.7604336142539978
0 references
[For the entire collection see Zbl 0593.00024.] Let A be a finite alphabet and p a probability distribution over A. We introduce, for a formal language L over A, the notions of Bernoullian density \(\delta_{L,p}\) and conditional waiting time \(\alpha_{L,p}\) obtaining an exterior measure: \(L\to \delta_{L,p}\) on \((A^*,P(A^*))\), where \(P(A^*)\) is the set of the subsets of \(A^*\), the free monoid genrated by A. First some examples of languages for which these parameters can easily be computed in all cases are studied. Then we consider two more complicated examples: Goldstine's language solved in all the cases with asymptotic estimate for the number of the prefix-free words of length n, and the language \(PAL_ m\) of the palindromes over m letters, for which the open problem (for \(m>2)\) of the equally likely case is completely solved.
0 references