Previous Page 4
Serge Burckel, Marianne Morillon (2010)
RAIRO - Theoretical Informatics and Applications
We construct, for each integer n, three functions from {0,1}n to {0,1} such that any boolean mapping from {0,1}n to {0,1}n can be computed with a finite sequence of assignations only using the n input variables and those three functions.
Cowen, L.J., Cowen, Robert, Steinberg, Arthur (2008)
The Electronic Journal of Combinatorics [electronic only]
Thi Ha Duong Phan (2008)
RAIRO - Theoretical Informatics and Applications
We introduce natural generalizations of two well-known dynamical systems, the Sand Piles Model and the Brylawski's model. We describe their order structure, their reachable configuration's characterization, their fixed points and their maximal and minimal length's chains. Finally, we present an induced model generating the set of unimodal sequences which amongst other corollaries, implies that this set is equipped with a lattice structure.
Aleksi Saarela (2011)
RAIRO - Theoretical Informatics and Applications
Sets of integers form a monoid, where the product of two sets A and B is defined as the set containing a+b for all and . We give a characterization of when a family of finite sets is a code in this monoid, that is when the sets do not satisfy any nontrivial relation. We also extend this result for some infinite sets, including all infinite rational sets.
Aleksi Saarela (2011)
RAIRO - Theoretical Informatics and Applications
Sets of integers form a monoid, where the product of two sets A and B is defined as the set containing a+b for all and . We give a characterization of when a family of finite sets is a code in this monoid, that is when the sets do not satisfy any nontrivial relation. We also extend this result for some infinite sets, including all infinite rational sets.
Östergård, Patric R.J., Weakley, William D. (2001)
The Electronic Journal of Combinatorics [electronic only]
L.J. Guibas, M. Sharir, J. Matousek, D. Halperin (1995)
Discrete & computational geometry
Previous Page 4