Context-free recognition via shortest paths computation: a version of Valiant's algorithm (Q673077): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4003168 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198075 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On efficient parallel computations of costs of paths on a grid graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: General context-free recognition in less than cubic time / rank | |||
Normal rank |
Latest revision as of 10:22, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Context-free recognition via shortest paths computation: a version of Valiant's algorithm |
scientific article |
Statements
Context-free recognition via shortest paths computation: a version of Valiant's algorithm (English)
0 references
28 February 1997
0 references
context-free languages
0 references