A tree series over a semiring with partially ordered carrier set can be considered as a fuzzy set. We investigate conditions under which it can also be understood as a fuzzi ed recognizable tree language. In this sense, su cient conditions are presented which, when imposed, ensure that every cut set, i.e., the pre-image of a prime lter of the carrier set, is a recognizable tree language. Moreov...

1: Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2: Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3: The Classical Sequent Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

Let B be a Brownian motion in R, d = 2, 3. A time t ∈ [0, 1] is called a cut time for B[0, 1] if B[0, t)∩B(t, 1] = ∅. We show that the Hausdorff dimension of the set of cut times equals 1−ζ, where ζ = ζd is the intersection exponent. The theorem, combined with known estimates on ζ3, shows that the percolation dimension of Brownian motion (the minimal Hausdorff dimension of a subpath of a Browni...

Parametric fault testing of a low noise amplifier based on Taylor series expansion of input-output function is presented. We classify the circuit under test (CUT) as faulty or good based on a comparison of the polynomial coefficients of the CUT with those of the fault-free circuit. The method needs little augmentation of circuit as only a minimal set of output parameters is used for classificat...

Abstract A generating set for a finite group G is minimal if no proper subset generates , and $m(G)$ denotes the maximal size of . We prove conjecture Lucchini, Moscatiello Spiga by showing that there exist $a,b> 0$ such any satisfies $m(G) \leqslant \cdot \delta (G)^b$ $\delta (G) = \sum _{p \text { prime}} m(G_p)$ where $G_p$ Sylow p -subgroup To do this, we first bound all almost simple g...