Normal form algorithms for extended context-free grammars (Q5958723): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Grail / rank | |||
Normal rank | |||
Revision as of 11:59, 28 February 2024
scientific article; zbMATH DE number 1715768
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Normal form algorithms for extended context-free grammars |
scientific article; zbMATH DE number 1715768 |
Statements
Normal form algorithms for extended context-free grammars (English)
0 references
3 March 2002
0 references
complexity
0 references
efficient algorithms
0 references
extended context-free grammars
0 references
grammatical representations
0 references
normal forms
0 references
symbolic manipulation
0 references
