Infinite language hierarchy based on regular regulated right linear grammars with start strings
The present paper discusses regular regulated right-linear grammars with start strings rather than single symbols. It demonstrates that these grammars with start strings consisting of no more than n + 1 symbols are stronger than these grammars with start strings consisting of no more than n symbols,...
| I publikationen: | Philippine computing journal 3, 2 (2008(D)). |
|---|---|
| Huvudupphovsman: | |
| Övriga upphovsmän: | |
| Materialtyp: | Artikel |
| Språk: | English |
| Ämnen: |