Derived linear systems of context-free grammars (Q805242)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Derived linear systems of context-free grammars |
scientific article; zbMATH DE number 4203731
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Derived linear systems of context-free grammars |
scientific article; zbMATH DE number 4203731 |
Statements
Derived linear systems of context-free grammars (English)
0 references
1991
0 references
Denote by b the vector of frequencies of using the productions of a context-free grammar in an arbitrary derivation. Generalizing an idea of \textit{C. S. Wetherell} [Comput. Surv. 12, 361-379 (1980; Zbl 0466.68073)], \textit{R. Chaudhuri}, \textit{S. Pham} and \textit{O. Garcia} [IEEE Trans. Comput. 32, 748-750 (1983; Zbl 0526.68075)] derived a matrix M such that \(Mb=(-1,0,0,...,0)^ T\), for b a vector of production frequencies in an arbitrary derivation. The converse of this result is considered here. Via an extension of the concept of Euler path grammars, one characterizes the grammars for which \(Mb=(-1,0,0,...,0)^ T\) implies the existence of a derivation whose production frequencies are given by b.
0 references
linear systems
0 references
context-free grammars
0 references
0.8962724
0 references
0 references
0.87833285
0 references
0.8721553
0 references
0.86746854
0 references
0 references