𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Inferability of context-free programmed grammars

✍ Scribed by H. R. Lu; K. S. Fu

Publisher
Springer
Year
1984
Tongue
English
Weight
987 KB
Volume
13
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A method for the inference of non-recurs
A method for the inference of non-recursive context-free grammars
✍ C. Chirathamjaree; Martin H. Ackroyd πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science βš– 438 KB

A practical method is presented for the automatic generation of a non-recursive context-free grammar (cfg) from a set of strings that the cfg is required to be capable of producing. The method is efficient in computing time by comparison with enumerative methods.

Cooperation in context-free grammars
Cooperation in context-free grammars
✍ JΓΌrgen Dassow; Victor Mitrana πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 527 KB

A new dynamical measure of the descriptional complexity for context-free grammars and languages, namely the degree of cooperation, is introduced and studied. This measure is connected with respect to both families of languages considered, namely the regular and context-free languages. We prove that