On the complexity of the recognition of parallel 2D-image languages
From MaRDI portal
Publication:808271
DOI10.1016/0020-0190(91)90063-NzbMATH Open0731.68068MaRDI QIDQ808271FDOQ808271
Authors: Wojciech Rytter, Ahmed Saoudi 
Publication date: 1991
Published in: Information Processing Letters (Search for Journal in Brave)
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
Formal languages and automata (68Q45) Computing methodologies for image processing (68U10) Grammars and rewriting systems (68Q42) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- An efficient context-free parsing algorithm
- Parallel computation and conflicts in memory access
- Title not available (Why is that?)
- Recognition and parsing of context-free languages in time n3
- General context-free recognition in less than cubic time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Matrix and Graph Algorithms
- Tree-size bounded alternation
- Title not available (Why is that?)
- The membership question for ETOL-languages is polynomially complete
- Parallel generation of infinite images
- Array grammar normal forms
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)
