相关论文: Finite automata, probabilistic method, and occurre…
In the study of infinite words, various notions of balancedness provide quantitative measures for how regularly letters or factors occur, and they find applications in several areas of mathematics and theoretical computer science. In this…
Given a countably infinite group $G$ acting on some space $X$, an increasing family of finite subsets $G_n$ and $x\in X$, a natural question to ask is what asymptotical distribution the sets $G_nx$ form. More formally, we define for a…
We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…
In this paper we introduce a new notion of a sequence of symmetry groups of an infinite word. Given a subgroup $G_n$ of the symmetric group $S_n$, it acts on the set of finite words of length $n$ by permutation. We associate to an infinite…
The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups…
Let $(X_n)_{n\ge 0}$ be an irreducible, aperiodic, and homogeneous binary Markov chain and let $LI_n$ be the length of the longest (weakly) increasing subsequence of $(X_k)_{1\le k \le n}$. Using combinatorial constructions and weak…
Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only terminals. In their original definition, patterns only allow for…
In this paper, we consider a variant of the classical algorithmic problem of checking whether a given word $v$ is a subsequence of another word $w$. More precisely, we consider the problem of deciding, given a number $p$ (defining a…
We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…
The deviation of the observed frequency of a word $w$ from its expected frequency in a given sequence $x$ is used to determine whether or not the word is avoided. This concept is particularly useful in DNA linguistic analysis. The value of…
Fix a probability $p\in(0,1)$. Let $s_i$ denote the transposition in the symmetric group $\mathfrak{S}_n$ that swaps $i$ and $i+1$. Given a word $\mathsf{w}$ over the alphabet $\{s_1,\ldots,s_{n-1}\}$, we can generate a random subword by…
Central, standard, and Christoffel words are three strongly interrelated classes of binary finite words which represent a finite counterpart of characteristic Sturmian words. A natural arithmetization of the theory is obtained by…
We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…
Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A partial permutation of length n with k holes is a sequence of symbols $\pi = \pi_1\pi_2 ... \pi_n$ in which each of the symbols from the…
We derive the asymptotic distribution of ordinal-pattern frequencies under weak dependence conditions and investigate the long-run covariance matrix not only analytically for moving-average, Gaussian, and the novel generalized coin-tossing…
Weighted automata (WA) are an important formalism to describe quantitative properties. Obtaining equivalent deterministic machines is a longstanding research problem. In this paper we consider WA with a set semantics, meaning that the…
The distributions of the number of occurrences of words (the distributions of words for short) play key roles in information theory, statistics, probability theory, ergodic theory, computer science, and DNA analysis. Bassino et al. 2010 and…
A non-Hermitean random matrix model proposed a few years ago has a remarkably intricate spectrum. Various attempts have been made to understand the spectrum, but even its dimension is not known. Using the Dyson-Schmidt equation, we show…
We introduce and study the repetitive variants of the deterministic and the nondeterministic finite automaton with translucent words (DFAwtw and NFAwtw). On seeing the right sentinel, a repetitive NFAwtw need not halt immediately, accepting…
We study a linear observation model with an unknown permutation called \textit{permuted/shuffled linear regression}, where responses and covariates are mismatched and the permutation forms a discrete, factorial-size parameter. The…