On the language of primitive words
β Scribed by H. Petersen
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 1014 KB
- Volume
- 161
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider slender languages, that is, languages for which the number of words of the same length is bounded from above by a constant. It is known that the slender context-free languages are precisely the unions of paired loops, that is, ΓΏnite unions of sets of the form {uv n wx n y | nΒΏ0}. Analysi
Let S be the set of all palindromes over B \*. It is well known. that the language S\* is an ultralinear, inherently ambiguous context-free language. In this paper we derive an explicit expression for the number of words of length n in S2. Furthermore, we show, that for card(P)> 1 the asymptotical d