Automata over Boolean Algebra
Luo Zhukai · Jisuanji gongcheng · 2004
A general formula is presented to count the number of nodes in a down-oriented tree. Some necessary and sufficient conditions are presented as well for an autonomous automaton to be a circle tree. This method is appied widely in many fields.