Services
-
Articles citing this article
- Same authors
-
Related articles
- Recommend this article
- Download citation
- Alert me when this article is cited
- Alert me when this article is corrected
|
Theoret. Informatics Appl. 39, 621-639 (2005)
DOI: 10.1051/ita:2005032
The entropy of Lukasiewicz-languages
Ludwig StaigerMartin-Luther-Universität Halle-Wittenberg, Institut für Informatik, von-Seckendorff- Platz 1, D-06099 Halle (Saale), Germany; staiger@informatik.uni-halle.de
(Received August 7, 2002. Accepted August 5, 2004.)
Abstract
The paper presents an elementary approach for the calculation of the entropy
of a class of languages. This approach is based on the consideration of
roots of a real polynomial and is also suitable for calculating the
Bernoulli measure. The class of languages we consider here is a
generalisation of the Lukasiewicz language.
Mathematics Subject Classification. 68Q30, 68Q45, 94A17
Key words: Entropy of languages -- Bernoulli measure of languages -- codes -- Lukasiewicz language
© EDP Sciences 2005
| What is OpenURL? |



Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook