✦ LIBER ✦

Descriptional complexity of context-free grammar forms

✍ Scribed by Erzsébet Csuhaj-Varjú; Alica Kelemenová

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 818 KB
Volume: 112
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90021-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Completeness of context-free grammar for

Completeness of context-free grammar forms

✍ H.A. Maurer; A. Salomaa; D. Wood 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 600 KB

Parallel context-free array grammar norm

Parallel context-free array grammar normal forms

✍ Patrick Shen-Pei Wang 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 342 KB

Unary Context-Free Grammars and Pushdown

Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds

✍ Giovanni Pighizzini; Jeffrey Shallit; Ming-wei Wang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 240 KB

It is well known that a context-free language defined over a one-letter alphabet is regular. This implies that unary context-free grammars and unary pushdown automata can be transformed into equivalent finite automata. In this paper, we study these transformations from a descriptional complexity poi

Consistency of stochastic context-free g

Consistency of stochastic context-free grammars

✍ Roland Gecse; Attila Kovács 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 405 KB

A simultaneous reduction of several meas

A simultaneous reduction of several measures of descriptional complexity in scattered context grammars

✍ H. Fernau; A. Meduna 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 92 KB

In this paper, we prove that every recursively enumerable language can be generated by a scattered context grammar with a reduced number of both nonterminals and context-sensing productions.

Statistical estimation of stochastic con

Statistical estimation of stochastic context-free grammars

✍ Francisco Casacuberta 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 636 KB