The Entropy of Lukasiewicz-Languages

Authors:
Ludwig Staiger
Affiliations:
-
Venue:
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Year:
2001

Citing 6
Cited 0

An introduction to Kolmogorov complexity and its applications

An introduction to Kolmogorov complexity and its applications
Kolmogorov complexity and Hausdorff dimension

Information and Computation
Valuations of languages, with applications to fractal geometry

Theoretical Computer Science
Context-free languages and pushdown automata

Handbook of formal languages, vol. 1
Automata, Languages, and Machines

Automata, Languages, and Machines
Theory of Codes

Theory of Codes

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents an elementary approach for the calculation of the entropy of a class of context-free languages. This approach is based on the consideration of roots of a real polynomial and is also suitable for calculating the Bernoulli measure.