Contextual array grammars with matrix and regular control

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We investigate the computational power of d-dimensional contextual array grammars with matrix control and regular control languages. For d ≥ 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.

Cite

CITATION STYLE

APA

Fernau, H., Freund, R., Siromoney, R., & Subramanian, K. G. (2016). Contextual array grammars with matrix and regular control. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9777, pp. 98–110). Springer Verlag. https://doi.org/10.1007/978-3-319-41114-9_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free