Makoto Sakamoto
Papers
1
Total Citations
3
H-Index
1
About
Makoto Sakamoto is a theoretical computer scientist whose research centers on automata theory, formal languages, and the computational geometry of higher-dimensional spaces. His work extends classical finite automata into three-dimensional environments, exploring how cooperating systems of automata can define hierarchies of computational power. In his most-cited paper, "Hierarchies based on the number of cooperating systems of three-dimensional finite automata" (2009), Sakamoto systematically investigates how increasing the number of cooperating automata expands the class of recognizable patterns in 3D grids. This contribution is foundational for understanding the limits and capabilities of distributed, space-bounded computation in multidimensional settings—a topic with implications for pattern recognition, image processing, and parallel computing models. While his citation count reflects a niche but dedicated audience, his work is valued by specialists in automata theory and computational geometry for its rigorous classification of complexity hierarchies. Sakamoto’s research continues to influence studies on cooperative computation and the formal analysis of spatial languages.
Research Focus
Key Achievements
Top Papers
- 1