Iterating bonferroni bounds

Binary segmentation and Bonferroni-type bounds

−∞ φ(t− ξ) · Φ(νt) dt, where φ and Φ are the pdf and cdf of N(0, 1), respectively. We derive two recurrence formulas for the effective computation of its values. We show that with an algorithm for this function, we can efficiently compute the second-order terms of Bonferroni-type inequalities yielding the upper and lower bounds for the distribution of a max-type binary segmentation statistic in...

Upper Bounds for Bivariate Bonferroni-type Inequalities Using Consecutive Events

Let A1, A2, . . . , Am and B1, B2, . . . , Bn be two sequences of events on the same probability space. Let X = Xm(A) and Y = Yn(B), respectively, denote the numbers of those Ai’s and Bj ’s which occur. We establish new bivariate Bonferroni-type inequalities using consecutive events and deduce a known result.

Iterating Octagons

In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct consequence of this fact is that the reachability problem is decidable for flat counter automata with octagonal transition relations. This result improves the previous results of Comon and Jurski [7] and Bozga, Iosif and Lakhnec...

Iterating Transducers

Iterating Definiteness

A central concept in the study of vagueness is the concept of a borderline case. This concept has its most basic application when we are faced with a question of the form ‘Is x F?’, but are unwilling to answer ‘Yes’ or ‘No’ for a certain distinctive kind of reason. Wanting to be co-operative, we need to say something; by saying ‘It’s a borderline case’, we excuse our failure to give a straightf...