An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages (Q1079015): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(86)90047-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2050655409 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3919065 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3219133 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bracket-languages are recognizable in logarithmic space / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:06, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages |
scientific article |
Statements
An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages (English)
0 references
1986
0 references
space complexity
0 references
language recognition
0 references
