The binary codes of the line graphs Lm(n) of the complete multipartite graphs Kn1,...,nm (ni = n for 1 ≤ i ≤ m) n ≥ 2, m ≥ 3 are examined, and PD-sets and s-PD-sets are fo...
A d-feedback-with-carry shift register (d-FCSR) is a finite state machine, similar to a linear feedback shift register, in which a small amount of memory and a delay (by d-clock c...
This paper explores internal representation power of product units [1] that act as the functional nodes in the hidden layer of a multi-layer feedforward network. Interesting proper...
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabi...
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...