scientific article; zbMATH DE number 3843161
From MaRDI portal
Publication:3313283
Recommendations
- Tree-Adjoining Language Parsing in O(n^6 ) Time
- scientific article; zbMATH DE number 4197438
- An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
- Parallel parsing of tree adjoining grammars on the connection machine
- A yo-yo parsing algorithm for a large class of van Wijngaarden grammars
Cited in
(6)- TAL recognition in O(M(n^2)) time
- A polynomial-time parsing algorithm for \(K\)-depth languages
- scientific article; zbMATH DE number 4051037 (Why is no real title available?)
- Tree-Adjoining Language Parsing in O(n^6 ) Time
- Clique-based lower bounds for parsing tree-adjoining grammars
- Implementation and Application of Automata
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 Q3313283)
