Related papers: Some Results on Digital Segments and Balanced Word…
We consider questions related to the structure of infinite words (over an integer alphabet) with bounded additive complexity, i.e., words with the property that the number of distinct sums exhibited by factors of the same length is bounded…
This paper proposes a simple test for compositionality (i.e., literal usage) of a word or phrase in a context-specific way. The test is computationally simple, relying on no external resources and only uses a set of trained word vectors.…
Performing both right and left multiplication operations using general regular matrix polynomials, which need not be monic and may possess leading coefficients of arbitrary rank, on a rectangular matrix of measures associated with mixed…
This article describes the results of a systematic in-depth study of the criteria used for word sense disambiguation. Our study is based on 60 target words: 20 nouns, 20 adjectives and 20 verbs. Our results are not always in line with some…
For $d\ge 1$, a word $w\in \{ 0,1\}^{\Z^d}$ is called balanced if there exists $M > 0$ such that for any two rectangles $R, R^{'}\subset\Z^d$ that are translates of each other, the number of occurrences of the symbol $1$ in $R$ and $R^{'}$…
We prove a precise formula for the minimal number K(n) such that every binary word of length $n$ can be divided into K(n) palindromes. Also we estimate the average number $\ol K(n)$ of palindromes composing a random binary word of the…
Continuous word representations learned separately on distinct languages can be aligned so that their words become comparable in a common space. Existing works typically solve a least-square regression problem to learn a rotation aligning a…
In this paper, we explore applications of combinatorics on words across various domains, including data compression, error detection, cryptographic protocols, and pseudorandom number generation. The examination of the theoretical…
Given a compact basic semi-algebraic set we provide a numerical scheme to approximate as closely as desired, any finite number of moments of the Hausdorff measure on the boundary of this set. This also allows one to approximate interesting…
We introduce a novel and general approach for digitalization of line segments in the plane that satisfies a set of axioms naturally arising from Euclidean axioms. In particular, we show how to derive such a system of digital segments from…
We present a method for the enumeration of restricted words over a finite alphabet. Restrictions are described through the inclusion or exclusion of suitable building blocks used to construct the words by concatenation. Our approach, which…
We present a novel and comparative analysis of finite element discretizations for a nonlinear Rosenau-Burgers model including a biharmonic term. We analyze both continuous and mixed finite element approaches, providing stability, existence,…
The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…
We present an analysis based on word combinatorics of splitting integrators for Ito or Stratonovich systems of stochastic differential equations. In particular we present a technique to write down systematically the expansion of the local…
Generalising a recent work of Dequ\^ene et al. on the connection between perfectly clustering words and band bricks over a particular family of gentle algebras, we characterise band bricks over string algebras whose underlying quiver is…
We develop and explore the idea of recognition of languages (in the general sense of subsets of topological algebras) as preimages of clopen sets under continuous homomorphisms into Stone topological algebras. We obtain an Eilenberg…
We introduce and study natural derivatives for Christoffel and finite standard words, as well as for characteristic Sturmian words. These derivatives, which are realized as inverse images under suitable morphisms, preserve the…
A finite word $w\in\{0,1\}^*$ is balanced if for every equal-length factors $u$ and $v$ of every cyclic shift of $w$ we have $||u|_1-|v|_1| <= 1$. This new class of finite words were defined in [JZ]. In [J], there was proved several results…
Borel and Reutenauer (2006) showed, \emph{inter alia}, that a word $w$ of length $n>1$ is conjugate to a Christoffel word if and only if for $k=0,1, \dots , n-1$, $w$ has $k+1$ distinct circular factors of length $k$. Sturmian words are the…
This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal…