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.
Recommendations
Cited in
(12)- scientific article; zbMATH DE number 3956466 (Why is no real title available?)
- scientific article; zbMATH DE number 3976349 (Why is no real title available?)
- scientific article; zbMATH DE number 3978415 (Why is no real title available?)
- ON ARRAY GRAMMARS AND LANGUAGES
- scientific article; zbMATH DE number 4047164 (Why is no real title available?)
- scientific article; zbMATH DE number 4049109 (Why is no real title available?)
- scientific article; zbMATH DE number 4049110 (Why is no real title available?)
- scientific article; zbMATH DE number 777293 (Why is no real title available?)
- Partial Commutation on Array Languages
- scientific article; zbMATH DE number 1406163 (Why is no real title available?)
- A class of (R:R) array languages
- A note on array grammars
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)