Pages that link to "Item:Q1096400"
From MaRDI portal
The following pages link to Parallel time O(log n) recognition of unambiguous context-free languages (Q1096400):
Displaying 12 items.
- Parallel algorithms for a class of graphs generated recursively (Q582922) (← links)
- An NC algorithm for recognizing tree adjoining languages (Q685232) (← links)
- On the parallel recognition of unambiguous context-free languages (Q808269) (← links)
- Fast parallel recognition of LR language suffixes (Q834947) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
- On efficient parallel computations for some dynamic programming problems (Q1109691) (← links)
- Unambiguity of circuits (Q1208408) (← links)
- Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's (Q1209354) (← links)
- Restricted CRCW PRAMs (Q1314395) (← links)
- Optimal parallel algorithms for dynamic expression evaluation and context-free recognition (Q1824389) (← links)
- On efficient parallel computations of costs of paths on a grid graph (Q1824395) (← links)
- A parallel algorithm for the minimization of finite state automata (Q4009721) (← links)
