Abstract | ||
---|---|---|
We investigate the computational power of d-dimensional contextual array grammars with matrix control and regular control languages. For (dge 2), d-dimensional contextual array grammars are less powerful than matrix contextual array grammars, which themselves are less powerful than contextual array grammars with regular control languages. Yet in the 1-dimensional case, for a one-letter alphabet, the family of 1-dimensional array languages generated by contextual array grammars with regular control languages coincides with the family of regular 1-dimensional array languages, whereas for alphabets with more than one letter, we obtain the array images of the linear languages. |
Year | Venue | Field |
---|---|---|
2016 | DCFS | Rule-based machine translation,Matrix (mathematics),Theoretical computer science,Artificial intelligence,Natural language processing,Mathematics,Alphabet |
DocType | Citations | PageRank |
Conference | 1 | 0.38 |
References | Authors | |
9 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Henning Fernau | 1 | 1646 | 162.68 |
Rudolf Freund | 2 | 12 | 2.39 |
Rani Siromoney | 3 | 459 | 76.25 |
K. G. Subramanian | 4 | 339 | 59.27 |