Advertisement

Acta Informatica

, Volume 9, Issue 1, pp 73–86 | Cite as

A class of measures on formal languages

  • J. Paredaens
  • R. Vyncke
Article

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.

Keywords

Information System Operating System Data Structure Communication Network Information Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brzozowski, J.: Derivatives of regular expressions, J. Assoc. Comput. Mach. 11, 481–494 (1964)Google Scholar
  2. 2.
    Ginsburg, S.: The mathematical theory of context free languages. New York: McGraw-Hill 1966Google Scholar
  3. 3.
    Hopcroft, J., Ullman, J.: Formal languages and their relation to automata. Reading (Mass.): Addison Wesley 1969Google Scholar
  4. 4.
    Salomaa, A.: On finite automata with a time-variant structure. Information and Control 13, 85–98 (1968)Google Scholar

Copyright information

© Springer-Verlag 1977

Authors and Affiliations

  • J. Paredaens
    • 1
  • R. Vyncke
    • 2
  1. 1.Research LaboratoriesNationaal Fonds voor Wetenschappelijk Onderzoek, M.B.L.E.BrusselsBelgium
  2. 2.Programme National d'Impulsion à la Recherche en InformatiqueComputing Centre V.U.B.-U.L.B.BrusselsBelgium

Personalised recommendations