Several properties of array languages

From MaRDI portal





Following Rosenfeld and Paun's definitions, the connected (disconnected) array grammars can be viewed as natural extensions to two dimensions of string grammars. It is studied whether the properties of string languages are preserved for the case of array languages or not. In particular, closure properties under substitutions are investigated, a characterization by means of substitutions for connected context-free array languages and a Kleene-like theorem for regular array languages are proved.











This page was built for publication: Several properties of array languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097039)