scientific article; zbMATH DE number 3997184
[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.
- Analytic models and ambiguity of context-free languages
- Some combinatorial results on Bernoulli sets and codes
- Completions in measure of languages and related combinatorial problems
- scientific article; zbMATH DE number 3885337 (Why is no real title available?)
- scientific article; zbMATH DE number 3919856 (Why is no real title available?)
- On cardinality of bigram languages
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 Q4723318)