A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On computational complexity of contextual languages
1997
Theoretical Computer Science
We consider the following restriction of internal contextual grammars, called local: in any derivation in a grammar, after applying a context, further contexts can be added only inside of or at most adjacent to the previous ones. We further consider a natural restriction of this derivation mode by requiring that no superword of the word considered as selector can be used as selector. We investigate the relevance of the latter type of grammars for natural language study. In this aim, we show
doi:10.1016/s0304-3975(96)00309-x
fatcat:gmvaqtv6arfrpnw5dnazph73hm