On Distributive Fixed-Point Expressions

Helmut Seidl; Damian Niwiński

Displaying similar documents to “On Distributive Fixed-Point Expressions”

Towards parametrizing word equations

H. Abdulrab, P. Goralčík, G. S. Makanin (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Classically, in order to resolve an equation ≈ over a free monoid *, we reduce it by a suitable family $ℱ$ of substitutions to a family of equations ≈ , $f \in ℱ$ , each involving less variables than ≈ , and then combine solutions of ≈ into solutions of ≈ . The problem is to get $ℱ$ in a handy form. The method we propose consists in parametrizing the path traces in the so called associated to ≈ . We carry out such a parametrization in the case the prime equations in the graph involve at...

Non-Trapping sets and Huygens Principle

Dario Benedetto, Emanuele Caglioti, Roberto Libero (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We consider the evolution of a set $Λ \subset ℝ^{2}$ according to the Huygens principle: the domain at time , Λ, is the set of the points whose distance from is lower than . We give some general results for this evolution, with particular care given to the behavior of the perimeter of the evoluted set as a function of time. We define a class of sets (non-trapping sets) for which the perimeter is a continuous function of , and we give an algorithm to approximate the evolution. Finally we restrict...

A Compositional Approach to Synchronize Two Dimensional Networks of Processors

Salvatore La Torre, Margherita Napoli, Mimmo Parente (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

The problem of synchronizing a network of identical processors that work synchronously at discrete steps is studied. Processors are arranged as an array of rows and columns and can exchange each other only one bit of information. We give algorithms which synchronize square arrays of ( × ) processors and give some general constructions to synchronize arrays of ( × ) processors. Algorithms are given to synchronize in time , $n ⌈ log n ⌉$ , $n ⌈ \sqrt{n} ⌉$ and 2 a square array of ( × ) processors. Our...

On the minimizing point of the incorrectly centered empirical process and its limit distribution in nonregular experiments

Dietmar Ferger (2010)

ESAIM: Probability and Statistics

Similarity:

Let be the empirical distribution function (df) pertaining to independent random variables with continuous df . We investigate the minimizing point ${\hat{τ}}_{n}$ of the empirical process , where is another df which differs from . If and are locally Hölder-continuous of order at a point our main result states that $n^{1 / α} ({\hat{τ}}_{n} - τ)$ converges in distribution. The limit variable is the almost sure unique minimizing point of a two-sided time-transformed homogeneous...

Exponential convergence of quadrature for integral operators with Gevrey kernels

Alexey Chernov, Tobias von Petersdorff, Christoph Schwab (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

Galerkin discretizations of integral equations in $ℝ^{d}$ require the evaluation of integrals $I = \int_{S^{(1)}} \int_{S^{(2)}} g (x, y) d y d x$ where , are -simplices and has a singularity at = . We assume that is Gevrey smooth for $\neq$ and satisfies bounds for the derivatives which allow algebraic singularities at = . This holds for kernel functions commonly occurring in integral equations. We construct a family of quadrature rules $𝒬_{N}$ using function evaluations of which...