par Paredaens, Jan J.J.;Vyncke, Roland 
Référence Acta informatica, 9, 1, page (73-86)
Publication Publié, 1977-03
Référence Acta informatica, 9, 1, page (73-86)
Publication Publié, 1977-03
Article révisé par les pairs
| Résumé : | 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. © 1977 Springer-Verlag. |
