Related papers: Finite random iterated function systems do not alw…
For any continuous probability measure $\mu$ on ${\mathbb R}$ we construct an IFS with probabilities having $\mu$ as its unique measure-attractor.
We study the finite convergence of iterative methods for solving convex feasibility problems. Our key assumptions are that the interior of the solution set is nonempty and that certain overrelaxation parameters converge to zero, but with a…
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination…
Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
We study invariant measures for random countable (finite or infinite) conformal iterated function systems (IFS) with arbitrary overlaps. We do not assume any type of separation condition. We prove, under a mild assumption of finite entropy,…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
The Central Limit Theorem for Iterated Functions Systems on the circle is proved. We study also ergodicity of such systems.
Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive…
We establish a lower bound for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of $n$ variables - a set containing a Boolean formula to represent each…
We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…
It is known that for any smooth periodic function $f$ the sequence $(f(2^kx))_{k\ge 1}$ behaves like a sequence of i.i.d.\ random variables, for example, it satisfies the central limit theorem and the law of the iterated logarithm. Recently…
This paper describes the celebrated aperiodic hat tiling by Smith et al. [Comb. Theory 8 (2024), 6] as generated by an overlapping iterated function system. We briefly introduce and study infinite sequences of iterated function systems that…
We study the properties of the set where a generalized function of bounded variation has infinite approximate limit, highlighting in this way the main geometric difference with functions of bounded variation. To this aim we prove a new…
When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…
Some properties of random Conley index are obtained and then a sufficient condition for the existence of abstract bifurcation points for both discrete-time and continuous-time random dynamical systems is presented. This stochastic…
Given a self-similar iterated function system $\Phi=\{ \phi_i(x)=\rho_i O_i x+t_i \}_{i=1}^m$ acting on $\mathbb{R}^d$, we can generate a parameterised family of iterated function systems by replacing each $t_i$ with a random vector in…
We revisit the problem of computing (robust) controlled invariant sets for discrete-time linear systems. Departing from previous approaches, we consider implicit, rather than explicit, representations for controlled invariant sets.…
This paper explores necessary and sufficient system conditions to solve distributed tasks with binary outputs (\textit{i.e.}, tasks with output values in $\{0,1\}$). We focus on the distinct output sets of values a task can produce…
Algorithms for (nondeterministic) finite-state tree automata (FTAs) are often tested on random FTAs, in which all internal transitions are equiprobable. The run-time results obtained in this manner are usually overly optimistic as most such…