# Search results

Theoretical Computer Science > 2015 > 583 > Complete > 1-26

^{n}to itself. We define the subnetworks of f as the restrictions of f to the subcubes of {0,1}

^{n}, and we characterize a class F of Boolean networks satisfying the following property: Every subnetwork of f has a unique fixed point if and only if f has no subnetwork in F. This characterization generalizes...

Mathematical Methods in the Applied Sciences > 47 > 12 > 10101 - 10116

Mathematical Methods in the Applied Sciences > 47 > 12 > 9556 - 9570

Mathematical Methods in the Applied Sciences > 47 > 11 > 8289 - 8318

Mathematical Methods in the Applied Sciences > 47 > 6 > 4014 - 4028

Mathematical Methods in the Applied Sciences > 47 > 6 > 4573 - 4591

Mathematical Methods in the Applied Sciences > 47 > 4 > 2030 - 2055

Mathematical Methods in the Applied Sciences > 47 > 4 > 1807 - 1822

Mathematical Methods in the Applied Sciences > 47 > 4 > 2503 - 2515

Opuscula Mathematica > 2024 > Vol. 44, no. 1 > 105--134

Mathematical Methods in the Applied Sciences > 46 > 13 > 14509 - 14526

Mathematical Methods in the Applied Sciences > 46 > 13 > 14229 - 14242

Mathematical Methods in the Applied Sciences > 46 > 13 > 13684 - 13694

Mathematical Methods in the Applied Sciences > 46 > 13 > 13631 - 13644

Mathematical Methods in the Applied Sciences > 46 > 5 > 5521 - 5544

Mathematica Applicanda > 2023 > Vol. 51, no. 2 > 223--237

Asian Journal of Control > 25 > 1 > 623 - 628

Fasciculi Mathematici > 2023 > nr 66 > 77--79