This paper is the second part of a work dealing with two Schiitzenberger's conjectures on variable-length codes. It contains the detailed proofs of the characterization that we obtained for the degree and the decomposability of finite maximal codes over the alphabet {a, b} with at most 3 occurrences of the letter b in each word.

We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family with many points contains all colors. This is dual (and in some cases equivalent) to the much investigated cover-decomposability problem.

New dual problems emphasizing decomposability are established for a general class of stochastic dynamic optimization problems, with piecewise linearquadratic objective function. Optimality conditions are derived which emphasize decomposition. The dual dynamics are conditioned on the available system state information, and this leads to a symmetry that is well-suited to computational methods suc...

Let F be a multifunction from a metric space X into L, and B a subset of X . We give sufficient conditions for the existence of a measurable selector of F which is continuous at every point of B. Among other assumptions, we require the decomposability of F (x) for x ∈ B.

We extend to materials with fading memory and materials with internal variables a result previously established for materials with instantaneous memory: the additive decomposability of the total energy into an internal and a kinetic part, and a representation of the latter and the inertial forces in terms of one and the same mass tensor.

Terpolymers are used to generate bio-decomposable self-assemblies. PEG-PVL-PGMA terpolymers synthesized via a combination of organocatalyzed living radical polymerization (RCMP) with polymerization-induced self-assembly (PISA), generating vesicle, multicompartment micelle (MCM), and core-compartmentalized worm (CCW), where PEG, PVL, PGMA poly(ethylene glycol) monomethyl ether, poly(?-valerolact...

Hindi/Urdu (HU) numbers 10–99 are highly irregular, unlike the transparent systems of most languages. I investigate the morphological decomposability of HU numbers using a series of computational models. While these models classify most forms accurately, problems are encountered in high-frequency forms of low cardinality, suggesting that some HU numbers are more transparent (i.e., morphological...