On the complexity of the recognition of parallel 2D-image languages
From MaRDI portal
(Redirected from Publication:808271)
Recommendations
- On the complexity of parallel parsing of general context-free languages
- scientific article; zbMATH DE number 3978426
- Parallel recognition and ranking of context-free languages
- On the parallel recognition of unambiguous context-free languages
- Parallel time O(log n) recognition of unambiguous context-free languages
Cites work
- scientific article; zbMATH DE number 4155887 (Why is no real title available?)
- scientific article; zbMATH DE number 3926247 (Why is no real title available?)
- scientific article; zbMATH DE number 3738961 (Why is no real title available?)
- scientific article; zbMATH DE number 43583 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 3412183 (Why is no real title available?)
- An efficient context-free parsing algorithm
- Array grammar normal forms
- General context-free recognition in less than cubic time
- Parallel Matrix and Graph Algorithms
- Parallel computation and conflicts in memory access
- Parallel generation of infinite images
- Recognition and parsing of context-free languages in time n3
- The membership question for ETOL-languages is polynomially complete
- Tree-size bounded alternation
Cited in
(2)
This page was built for publication: On the complexity of the recognition of parallel 2D-image languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808271)
