Computation of Boolean functions on networks of binary automata
作者：
Highlights：
•
摘要
In this report it is shown that a tree-connected network n binary automata can compute any Boolean transformation on n variables if and only if the underlying graph is a star.
论文关键词：
论文评审过程：Received 4 June 1980, Revised 9 March 1981, Available online 2 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(83)90016-8
