Fast context-free grammar parsing requires fast boolean matrix multiplication
Journal of the ACM (JACM)
Linearity and nondeletion on monadic context-free tree grammars
Information Processing Letters
Restrictions on monadic context-free tree grammars
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Approximation Algorithms for Optimal RNA Secondary Structures Common to Multiple Sequences
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Linearity and nondeletion on monadic context-free tree grammars
Information Processing Letters
Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Deterministic recognition of trees accepted by a linear pushdown tree automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Parsing by matrix multiplication generalized to Boolean grammars
Theoretical Computer Science
| Hi-index | 0.01 |