A Field Based Solution of Mazoyer's FSSP Schema
Résumé
Continuing our line of work on field based cellular automata programming we, here, focus our attention on an implementation of Ma-zoyer's schema for cellular synchronization problem. Due to its very special nature among the numerous solutions to the problem, we emphasize the power of cellular fields to construct cellular programs: clear semantic construction, modularity, automatic synthesis of finite state machines.