A class of measures on formal languages
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.
KeywordsInformation System Operating System Data Structure Communication Network Information Theory
Unable to display preview. Download preview PDF.
- 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 1966Google Scholar
- 3.Hopcroft, J., Ullman, J.: Formal languages and their relation to automata. Reading (Mass.): Addison Wesley 1969Google Scholar
- 4.Salomaa, A.: On finite automata with a time-variant structure. Information and Control 13, 85–98 (1968)Google Scholar