Formal languages
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
One-Pass Complexity of Digital Picture Properties
Journal of the ACM (JACM)
Syntax-directed interpretation of classes of pictures
Communications of the ACM
Pattern generation in non-standard tessellation automata
ACM '73 Proceedings of the ACM annual conference
Formal languages and their relation to automata
Formal languages and their relation to automata
Formal properties of sequential/parallel matrix languages
ACM '76 Proceedings of the 1976 annual conference
Two-dimensional grammars and structured programming languages
ACM SIGPLAN Notices
Formal modeling by a bi-parallel grammar
MMACTEE'06 Proceedings of the 8th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
| Hi-index | 0.00 |
A new system, that of matrix grammars, for two-dimensional pattern processing, is introduced. A hierarchy, induced on Chomsky's is found. Language operations such as union, catenation (row and column), Kleene's closure (row and column), and homomorphisms are investigated. It is found that the smallest class of these languages may serve as the class of regular arrays, which is defined as the smallest class of arrays closed under union, catenation (row and column) and Kleene's closure (row and column). Eight possible ways of defining a matrix language are discussed and it is suggested that one of them may lead to a normal form for matrix grammars. The method is advantageous over others on several points. Perhaps the most interesting of all is that it provides a compromise between sequential methods which take too much time for large arrays and parallel methods which usually take too much hardware for large arrays.