An NC algorithm for recognizing tree adjoining languages
From MaRDI portal
Publication:685232
DOI10.1007/BF01408291zbMATH Open0777.68059OpenAlexW1990102452MaRDI QIDQ685232FDOQ685232
Michael A. Palis, Sunil Shende
Publication date: 30 September 1993
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01408291
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Grammars and rewriting systems (68Q42) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- A taxonomy of problems with fast parallel algorithms
- Tree adjunct grammars
- Parallel time O(log n) recognition of unambiguous context-free languages
- Upper bounds on recognition of a hierarchy of non-context-free languages
- Optimization of LR(k) parsers
- Simulation of Parallel Random Access Machines by Circuits
- Parallel Parsing on a One-Way Array of Finite-State Machines
- Tree-size bounded alternation
- Parallel parsing on the connection machine
- Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition
- An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
- On Parsing and Compiling Arithmetic Expressions on Vector Computers
- Upper Bounds for Speedup in Parallel Parsing
- Speed of Recognition of Context-Free Languages by Array Automata
This page was built for publication: An NC algorithm for recognizing tree adjoining languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685232)
