Boundedness testing for unambiguous context-free grammars (Q594604): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:44, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Boundedness testing for unambiguous context-free grammars |
scientific article |
Statements
Boundedness testing for unambiguous context-free grammars (English)
0 references
1983
0 references
bounded language
0 references
left Szilard language
0 references
polynomial time algorithm
0 references
unambiguous context-free grammars
0 references
