作者: Maurice Tchuente
DOI: 10.1137/0606052
关键词: Combinatorics 、 Mathematics 、 Permutation 、 Boolean data type 、 Discrete mathematics 、 Binary number 、 Deterministic automaton 、 Factorization 、 Star (graph theory) 、 Automaton
摘要: In this paper it is shown that, in the worst case, delay necessary to permute boolean variables on a star-connected network of n binary automata $n - 1$.