Time complexity of unambiguous path systems (Q1170033)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3782386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time complexity of unambiguous path systems |
scientific article; zbMATH DE number 3782386 |
Statements
Time complexity of unambiguous path systems (English)
0 references
1982
0 references
deterministic two-way pushdown automata
0 references
unambiguous context-free languages
0 references
bottom-up simulation
0 references
linear time algorithms
0 references
