The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index (Q1099632)

It is proved that the Dyck language over one parenthesis is not generated by any matrix grammar with finite index. To prove this the author (A) introduces the notion of a word index in such a way that if the grammar index is finite so is the index of each word, (B) gives a family of words in the Dyck language over one parenthesis which needs unbounded word indices. The proof contains many technical considerations. The consequence of this main result is that the Dyck language over one parenthesis is not generated by any EDT0L system. Many misprints cause difficulties in the understanding of considerations presented in the paper.