%0 Conference Proceedings
%T Contextual Array Grammars with Matrix and Regular Control
%+ Trier University
%+ Vienna University of Technology = Technische Universität Wien (TU Wien)
%+ Chennai Mathematical Institute [Inde]
%+ Liverpool Hope University
%A Fernau, Henning
%A Freund, Rudolf
%A Siromoney, Rani
%A Subramanian, K., G.
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
%C Bucharest, Romania
%Y Cezar Câmpeanu
%Y Florin Manea
%Y Jeffrey Shallit
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-9777
%P 98-110
%8 2016-07-05
%D 2016
%R 10.1007/978-3-319-41114-9_8
%Z Computer Science [cs]Conference papers
%X We investigate the computational power of d-dimensional contextual array grammars with matrix control and regular control languages. For $$d\ge 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.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01633942/document
%2 https://inria.hal.science/hal-01633942/file/416473_1_En_8_Chapter.pdf
%L hal-01633942
%U https://inria.hal.science/hal-01633942
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-LNCS-9777
%~ IFIP-WG1-2