A Survey of Two-Dimensional Automata Theory

Authors:
Katsushi Inoue;Itsuo Takanami
Affiliations:
-;-
Venue:
Proceedings of the 5th International Meeting of Young Computer Scientists on Machines, Languages, and Complexity
Year:
1988

Representations of Recursively Enumerable Array Languages by Contextual Array Grammars

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases

Fundamenta Informaticae - Machines, Computations and Universality, Part II
Networks of Evolutionary Picture Processors with Filtered Connections

UC '09 Proceedings of the 8th International Conference on Unconventional Computation
The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases

Fundamenta Informaticae - Machines, Computations and Universality, Part II
Representations of Recursively Enumerable Array Languages by Contextual Array Grammars

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY

Fundamenta Informaticae

Hi-index	0.00