scientific article; zbMATH DE number 3926247
From MaRDI portal
Publication:3700838
Recommendations
Cited in
(24)- Optimal parallel parsing of bracket languages
- On the complexity of parallel parsing of general context-free languages
- Parallel time O(log n) recognition of unambiguous context-free languages
- On efficient parallel computations for some dynamic programming problems
- A sublinear parallel algorithm for some dynamic programming problems
- On the determinacy problem for two-way pushdown automata
- Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
- On efficient parallel computations of costs of paths on a grid graph
- A practical simulation result for two-way pushdown automata
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
- On the Expressive Power of 2-Stack Visibly Pushdown Automata
- scientific article; zbMATH DE number 4101166 (Why is no real title available?)
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- Simultaneously One-Turn Two-Pushdown Automata
- Simulation of two-way pushdown automata revisited
- Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
- Parallel recognition and ranking of context-free languages
- Parallel algorithms for a class of graphs generated recursively
- Parallel parsing of tree adjoining grammars on the connection machine
- An NC algorithm for recognizing tree adjoining languages
- An efficient all-parses systolic algorithm for general context-free parsing
- On the parallel recognition of unambiguous context-free languages
- On the complexity of the recognition of parallel 2D-image languages
- Fast parallel recognition of LR language suffixes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3700838)
