𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The language intersection problem for non-recursive context-free grammars

✍ Scribed by Mark-Jan Nederhof; Giorgio Satta

Book ID
113641518
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
286 KB
Volume
192
Category
Article
ISSN
0890-5401

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.

The unsolvability of the equality proble
The unsolvability of the equality problem for sentential forms of context-free grammars
✍ Meera Blattner πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 258 KB

The equivalence problem for nondeterministic e-free generalized machines is known to be undecidable. It is shown here that the equivalence problem for these machines can be reduced to the equality problem of the sentential forms of a particular type of linear context-free grammars with a center-mark