Related papers: Finite-state independence

In this paper we give and prove a criterion for the normality of unbounded closed operators, which is a sort of a maximality result which will be called "double maximality". As applications, we show, under some assumptions, that the sum of…

This note contains a report of a proof by computer that the Fibonacci group F(2,9) is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore, it can be seen directly from the word-acceptor that…

We propose a new nonparametric test for the supposition of independence between two continuous random variables. The test is based on the size of the longest increasing subsequence of a random permutation. We identified the independence…

We show how to reduce free independence to tensor independence in the strong sense. We construct a suitable unital *-algebra of closed operators `affiliated' with a given unital *-algebra and call the associated closure `monotone'. Then we…

We propose a novel statistical test to assess the mutual independence of multidimensional random vectors. Our approach is based on the $L_1$-distance between the joint density function and the product of the marginal densities associated…

We consider nonlinear, or "event-dependent", sampling, i.e. such that the sampling instances {tk} depend on the function being sampled. The use of such sampling in the construction of Lebesgue's integral sums is noted and discussed as…

We show that one single experiment can test simultaneously and independently both the nonclassicality of states and measurements by the violation or fulfillment of classical bounds on the statistics. Nonideal measurements affected by…

Given all (finite) moments of two measures $\mu$ and $\lambda$ on $\R^n$, we provide a numerical scheme to obtain the Lebesgue decomposition $\mu=\nu+\psi$ with $\nu\ll\lambda$ and $\psi\perp\lambda$. When$\nu$ has a density in…

The automatic complexity of a finite word (string) is an analogue for finite automata of Sipser's distinguishing complexity (1983) and was introduced by Shallit and Wang (2001). For a finite alphabet $\Sigma$ of at least two elements, we…

Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given…

We prove several results concerning finitely generated submonoids of the free monoid. These results generalize those known for free submonoids. We prove in particular that if $X=Y\circ Z$ is a composition of finite sets of words with $Y$…

Jumping automata are finite automata that read their input in a non-consecutive manner, disregarding the order of the letters in the word. We introduce and study jumping automata over infinite words. Unlike the setting of finite words,…

In this paper we study different concepts of independence for convex sets of probabilities. There will be two basic ideas for independence. The first is irrelevance. Two variables are independent when a change on the knowledge about one…

We investigate the number of sets of words that can be formed from a finite alphabet, counted by the total length of the words in the set. An explicit expression for the counting sequence is derived from the generating function, and…

We consider the problem of computing the measure of a regular set of infinite binary trees. While the general case remains unsolved, we show that the measure of a language can be computed when the set is given in one of the following three…

A joint limit theorem for the point process of the off-diagonal entries of a sample covariance matrix $\mathbf{S}$, constructed from $n$ observations of a $p$-dimensional random vector with iid components, and the Frobenius norm of…

We propose a test of independence of two multivariate random vectors, given a sample from the underlying population. Our approach, which we call MINT, is based on the estimation of mutual information, whose decomposition into joint and…

We propose an estimator of the Hilbert-Schmidt Independence Criterion obtained from an appropriate modification of the usual estimator. We then get asymptotic normality of this estimator both under independence hypothesis and under the…

A deterministic finite automaton (DFA) separates two strings $w$ and $x$ if it accepts $w$ and rejects $x$. The minimum number of states required for a DFA to separate $w$ and $x$ is denoted by $sep(w,x)$. The present paper shows that the…

We presents an independence relation on sets, one can define dimension by it, assuming that we have an abstract elementary class with a forking notion that satisfies the axioms of a good frame minus stability.