Pages that link to "Item:Q1128670"
From MaRDI portal
The following pages link to Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages (Q1128670):
Displaying 5 items.
- Fast nondeterministic recognition of context-free languages using two queues (Q293326) (← links)
- Fast parallel recognition of LR language suffixes (Q834947) (← links)
- Some subclasses of context-free languages in \(NC^ 1\) (Q1112610) (← links)
- A lower bound for the nondeterministic space complexity of context-free recognition (Q1198017) (← links)
- Parallel recognition and ranking of context-free languages (Q5096817) (← links)