Skip to main content
SpringerLink
Log in

The Entropy of Lukasiewicz-Languages

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2295))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.-M. Autebert, J. Berstel and L. Boasson, Context-Free Languages and Pushdown Automata, in: Handbook of Formal Languages,G. Rozenberg and A. Salomaa (Eds.),Vol. 1, Springer-Verlag, Berlin 1997, 111–174.

    Google Scholar 

  2. J. Berstel and D. Perrin. Theory of Codes. Academic Press, Orlando 1985.

    MATH  Google Scholar 

  3. J. Devolder, M. Latteux, I. Litovski and L. Staiger, Codes and Infinite Words, Acta Cybernetica, 11 (1994), 241–256.

    MATH  MathSciNet  Google Scholar 

  4. S. Eilenberg, Automata, Languages and Machines. Vol. A, Academic Press, New York 1974.

    Google Scholar 

  5. H. Fernau, Valuations of Languages, with Applications to Fractal Geometry, Theoret. Comput. Sci., 137 (1995), 177–217.

    Article  MATH  MathSciNet  Google Scholar 

  6. R. Johannesson, Informationstheorie, Addison-Wesley, 1992.

    Google Scholar 

  7. J. Justesen and K. Larsen, On Probabilistic Context-Free Grammars that Achieve Capacity, Inform. Control 29 (1975), 268–285.

    Article  MATH  MathSciNet  Google Scholar 

  8. W. Kuich, On the Entropy of Context-Free Languages, Inform. Control 16 (1970), 173–200.

    Article  MATH  MathSciNet  Google Scholar 

  9. M. Li and P.M.B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, NewYork, 1993.

    MATH  Google Scholar 

  10. L. Staiger, On infinitary finite length codes, RAIRO-Inform. Théor., 20 (1986), 483–494.

    MathSciNet  MATH  Google Scholar 

  11. L. Staiger, Kolmogorov Complexity and Hausdorff Dimension. Inform. and Comput. 103 (1993), 159–194.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg, von-Seckendorff-Platz 1, D-06099, Halle (Saale), Germany

    Ludwig Staiger

Authors
  1. Ludwig Staiger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Staiger, L. (2002). The Entropy of Lukasiewicz-Languages. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation