On the computational complexity of Marcus contextual languages
Fundamenta Informaticae
Contextual grammars and natural languages
Handbook of formal languages, vol. 2
Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
On computational complexity of contextual languages
Theoretical Computer Science - Special issue: formal language theory
An efficient parser for a class of contextual languages
Fundamenta Informaticae - Special issue on grammar systems
An efficient context-free parsing algorithm
Communications of the ACM
Marcus Contextual Grammars
An efficient online parser for contextual grammars with at most context-free selectors
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
k-local internal contextual grammars
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Hi-index | 0.00 |
We extend the result from [8] by giving also a concrete polynomial parsing algorithm for a class of languages generated by a variant of contextual grammars, namely local internal contextual grammars with context-free choice.