An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
From MaRDI portal
Publication:3474285
DOI10.1137/0219001zbMath0696.68095OpenAlexW2053309264MaRDI QIDQ3474285
David S. L. Wei, Michael A. Palis, Sunil M. Shende
Publication date: 1990
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0219001
Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Cellular automata (computational aspects) (68Q80) Natural language processing (68T50)
Related Items
Parallel parsing of tree adjoining grammars on the connection machine ⋮ An NC algorithm for recognizing tree adjoining languages ⋮ TAL recognition in \(O(M(n^2))\) time