✦ LIBER ✦

A method for the inference of non-recursive context-free grammars

✍ Scribed by C. Chirathamjaree; Martin H. Ackroyd

Publisher: Elsevier Science
Year: 1980
Weight: 438 KB
Volume: 12
Category: Article
ISSN: 0020-7373
DOI: 10.1016/s0020-7373(80)80022-8

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Remarks on the structural grammatical in

Remarks on the structural grammatical inference problem for context-free grammars

✍ Erkki Mäkinen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 266 KB

On the structural grammatical inference

On the structural grammatical inference problem for some classes of context-free grammars

✍ Erkki Mäkinen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 397 KB

Homogeneous grammars with a reduced numb

Homogeneous grammars with a reduced number of non-context-free productions

✍ A. Meduna; D. Kolář 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 70 KB

A homogeneous production has its left-hand side formed by a non-empty string of identical nonterminals. A phrase-structure grammar is homogeneous if each of its productions is homogeneous. The present paper discusses the reduction of homogeneous grammars with respect to the number of non-context-fre

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

A method of coding hand-written Arabic c

A method of coding hand-written Arabic characters and its application to context-free grammar

✍ A.O.M. Saleh 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 468 KB

The obstructions of a minor-closed set o

The obstructions of a minor-closed set of graphs defined by a context-free grammar

✍ B Courcelle; G Sénizergues 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 979 KB

We establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be effectively constructed. Our proof uses an auxiliary result stating that the system of equations associated with a proper hyperedge replacement grammar has a unique soluti