Currently displaying 1 – 6 of 6

Showing per page

Order by Relevance | Title | Year of publication

The entropy of Łukasiewicz-languages

Ludwig Staiger — 2005

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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 Łukasiewicz language.

The entropy of Łukasiewicz-languages

Ludwig Staiger — 2010

RAIRO - Theoretical Informatics and Applications

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 Łukasiewicz language.

Decidability of code properties

Henning FernauKlaus ReinhardtLudwig Staiger — 2007

RAIRO - Theoretical Informatics and Applications

We explore the borderline between decidability and undecidability of the following question: “Let be a class of codes. Given a machine 𝔐 of type , is it decidable whether the language L ( 𝔐 ) lies in or not?” for codes in general, -codes, codes of finite and bounded deciphering delay, prefix, suffix and bi(pre)fix codes, and for finite automata equipped with different versions of push-down stores and counters.

Page 1

Download Results (CSV)