Skip to main content
Springer Nature Link
Log in

A class of measures on formal languages

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In this paper we introduce a class of measures on formal languages. These measures are based on the number of different ways a string of a specified finite length can be completed to obtain strings of the language. The relation with automata and grammars is established, and the polynomial measure, a special case of the general notion, is studied in detail. We give some closure properties for well-known operations on languages, and finally, we prove that the class of polynomial measurable languages is a Pre-AFL.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Brzozowski, J.: Derivatives of regular expressions, J. Assoc. Comput. Mach. 11, 481–494 (1964)

    Google Scholar 

  2. Ginsburg, S.: The mathematical theory of context free languages. New York: McGraw-Hill 1966

    Google Scholar 

  3. Hopcroft, J., Ullman, J.: Formal languages and their relation to automata. Reading (Mass.): Addison Wesley 1969

    Google Scholar 

  4. Salomaa, A.: On finite automata with a time-variant structure. Information and Control 13, 85–98 (1968)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Laboratories, Nationaal Fonds voor Wetenschappelijk Onderzoek, M.B.L.E., Van Becelaerelaan 2, B-1170, Brussels, Belgium

    J. Paredaens

  2. Programme National d'Impulsion à la Recherche en Informatique, Computing Centre V.U.B.-U.L.B., 91, Av. A. Buyl, B-1050, Brussels, Belgium

    R. Vyncke

Authors
  1. J. Paredaens
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Vyncke
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Paredaens, J., Vyncke, R. A class of measures on formal languages. Acta Informatica 9, 73–86 (1977). https://doi.org/10.1007/BF00263766

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00263766

Keywords