A graph is observable if there exists an integer T such that for all words w of length | w | ≥ T , | δ w ( V ) | ≤ 1 .
確定! 回上一頁