2 . we prove that one kind of invertible autonomous automata has the same graph structure as its affine autonomous automata [ theorem 4.5 ] (2)證明了布爾環(huán)上的一類可逆線性內(nèi)動機的圖型與其仿射內(nèi)動機的圖型相同定理4.5。
2 . we prove that one kind of invertible autonomous automata has the same graph structure as its affine autonomous automata [ theorem 4.5 ] (2)證明了布爾環(huán)上的一類可逆線性內(nèi)動機的圖型與其仿射內(nèi)動機的圖型相同定理4.5。
3 . the graph structure of some non-invertible autonomous automata is discussed in regular space, orthogonal space, and orthonormal space respectively . some new results are derived [ theorem 3.10-3.13 ] (3)討論了非可逆線性內(nèi)動機在正規(guī)空間、直交空間、正交空間上的圖型結構問題[定理3.103.13]。
We explore the graph structure of the autonomous automata over boolean ring and derive the following new results : 1 . we determine the graph structure of a kind of exact-equibranch down-oriented-tree autonomous automata and of a kind of invertible autonomous automata [ theorem 4.1-4.4 ] 本文研究了有限布爾環(huán)上的內(nèi)動機圖型結構,取得了下列成果:(1)定出了布爾環(huán)上的一類具有等叉下向樹形的線性內(nèi)動機和一類可逆線性內(nèi)動機的圖型定理4.1~4.4]。
We explore the graph structure of the autonomous automata over boolean ring and derive the following new results : 1 . we determine the graph structure of a kind of exact-equibranch down-oriented-tree autonomous automata and of a kind of invertible autonomous automata [ theorem 4.1-4.4 ] 本文研究了有限布爾環(huán)上的內(nèi)動機圖型結構,取得了下列成果:(1)定出了布爾環(huán)上的一類具有等叉下向樹形的線性內(nèi)動機和一類可逆線性內(nèi)動機的圖型定理4.1~4.4]。
We explore the graph structure of the autonomous automata over boolean ring and derive the following new results : 1 . we determine the graph structure of a kind of exact-equibranch down-oriented-tree autonomous automata and of a kind of invertible autonomous automata [ theorem 4.1-4.4 ] 本文研究了有限布爾環(huán)上的內(nèi)動機圖型結構,取得了下列成果:(1)定出了布爾環(huán)上的一類具有等叉下向樹形的線性內(nèi)動機和一類可逆線性內(nèi)動機的圖型定理4.1~4.4]。
In this thesis, we study the non-invertible linear finite autonomous automata and derive the following new results : 1 . a formula is given to count the number of the nodes of every level in a down-oriented tree of an autonomous automaton . then a necessary and sufficient condition is presented for the graph of an autonomous automaton to be an exact-equibranch down-oriented tree [ theorem 3.2-3.3 ] 本文研究了布爾代數(shù)上非可逆的線性內(nèi)動機,取得了下列成果:(1)給出了線性內(nèi)動機下向樹形中每一層節(jié)點的計數(shù)公式和下向樹是等叉下向樹形的判定條件[定理3.23.3]。
In this thesis, we study the non-invertible linear finite autonomous automata and derive the following new results : 1 . a formula is given to count the number of the nodes of every level in a down-oriented tree of an autonomous automaton . then a necessary and sufficient condition is presented for the graph of an autonomous automaton to be an exact-equibranch down-oriented tree [ theorem 3.2-3.3 ] 本文研究了布爾代數(shù)上非可逆的線性內(nèi)動機,取得了下列成果:(1)給出了線性內(nèi)動機下向樹形中每一層節(jié)點的計數(shù)公式和下向樹是等叉下向樹形的判定條件[定理3.23.3]。
In this thesis, we study the non-invertible linear finite autonomous automata and derive the following new results : 1 . a formula is given to count the number of the nodes of every level in a down-oriented tree of an autonomous automaton . then a necessary and sufficient condition is presented for the graph of an autonomous automaton to be an exact-equibranch down-oriented tree [ theorem 3.2-3.3 ] 本文研究了布爾代數(shù)上非可逆的線性內(nèi)動機,取得了下列成果:(1)給出了線性內(nèi)動機下向樹形中每一層節(jié)點的計數(shù)公式和下向樹是等叉下向樹形的判定條件[定理3.23.3]。