Systems of deterministic finite automata communicating by sending their states upon request are investigated. when the amount of communication is restricted. The computational power and decidability properties are studied for the case of returning centralized systems. when the number of necessary communications during the computations of the system is bounded by a function depending o... https://www.roneverhart.com/Bonsai-Tree/