Regular model checking is an exploration technique for infinite state systems where spaces are represented as regular languages and transition relations expressed using rational over (or finite) strings. We extend the paradigm to permit use of more powerful relations: class relations, which a strict subset. language monadic second-order logic (MSO) on strings specify such adopt streaming string...

In this note the distribution of the approximation coeecients n, associated with the regular continued fraction expansion of numbers x 2 0; 1), is given under extra conditions on the numerators and denominators of the convergents pn=qn. Similar results are also obtained for S-expansions. Further, a Gauss-Kusmin type theorem is derived for the regular continued fraction expansion under these ext...

We investigate infinitely divisible distributions on cones in Fréchet spaces. We show that every infinitely divisible distribution concentrated on a normal cone has the regular Lévy–Khintchine representation if and only if the cone is regular. These results are relevant to the study of multidimensional subordination.

The average bit erasure probability of a binary linear code ensemble under maximum a-posteriori probability (MAP) decoding over binary erasure channel (BEC) can be calculated with the average support weight distribution of the ensemble via the EXIT function and the shortened information function. In this paper, we formulate the relationship between the average bit erasure probability under MAP ...

We study the weight distribution of a perfect coloring (equitable partition) of a graph with respect to a completely regular code (in particular, with respect to a vertex if the graph is distance-regular). We show how to compute this distribution by the knowledge of the percentage of the colors over the code. For some partial cases of completely regular codes we derive explicit formulas of weig...

Mathematical models of inventory-distribution routing problem for two-echelon agriculture products distribution network are established, which are based on two management modes, franchise chain and regular chain, one-to-many, interval periodic order, demand depending on inventory, deteriorating treatment cost of agriculture products, start-up costs of vehicles and so forth.Then, a heuristic ada...

We study the weight distribution of a perfect coloring (equitable partition) of a graph with respect to a completely regular code (in particular, with respect to a vertex if the graph is distance-regular). We show how to compute this distribution by the knowledge of the percentage of the colors over the code. For some partial cases of completely regular codes we derive explicit formulas of weig...

A random vector X with representation X = ∑ j≥0 AjZj is considered. Here, (Zj) is a sequence of independent and identically distributed random vectors and (Aj) is a sequence of random matrices, ‘predictable’ with respect to the sequence (Zj). The distribution of Z1 is assumed to be multivariate regular varying. Moment conditions on the matrices (Aj) are determined under which the distribution o...

We examine challenges to estimation and inference when the objects of interest are nondifferentiable functionals of the underlying data distribution. This situation arises in a number of applications of bounds analysis and moment inequality models, and in recent work on estimating optimal dynamic treatment regimes. Drawing on earlier work relating differentiability to the existence of unbiased ...