Related papers: The Triple-Pair Construction for Weighted $\omega$…
In this paper we present a new and simple language-independent method for word-alignment based on the use of external sources of bilingual information such as machine translation systems. We show that the few parameters of the aligner can…
A numeration system originally implies a digitization of real numbers, but in this paper it rather implies a compactification of real numbers as a result of the digitization. By definition, a numeration system with $G$, where $G$ is a…
In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism. Yet, we prove that the conversion of an unambiguous…
Sigma models on semi-symmetric spaces provide the central building block for string theories on AdS backgrounds. Under certain conditions on the global supersymmetry group they can be made one-loop conformal by adding an appropriate…
We present a strongly exponential lower bound that applies both to the subset synchronization threshold for binary deterministic automata and to the careful synchronization threshold for binary partial automata. In the later form, the…
Reversible weighted automata are introduced and considered in a specific setting where the weights are taken from a nontrivial locally finite commutative ring such as a finite field. It is shown that the supports of series realised by such…
Given a totally finite ordered alphabet $ A $, endowing the set of words over $ A $ with the alternating lexicographic order, we define a new class of Lyndon words. We study the fundamental properties of the associated symbolic dynamical…
This paper shows how to construct explicitly an automaton that generates an arbitrary numerical semigroup.
We propose a new extension of higher-order pushdown automata, which allows to use an infinite alphabet. The new automata recognize languages of data words (instead of normal words), which beside each its letter from a finite alphabet have a…
The paper explains the connection between topological theories for one-manifolds with defects and values in the Boolean semiring and automata and their generalizations. Finite state automata are closely related to regular languages. To each…
Given a group \( G \), a field \( \kappa \), and a factor set \( \sigma \) arising from a partial projective \( \kappa \)-representation of \( G \). This leads to the construction of a topological partial dynamical system \( (\Omega_\sigma,…
A right [left] locally testable language S is a language with the property that for some non negative integer k two words u and v in alphabet S are equal in the semi group if (1) the prefix and suffix of the words of length k coincide, (2)…
Given a connected simply connected semisimple group G and a connected spherical subgroup K we determine the generators of the extended weight monoid of G/K, based on the homogeneous spherical datum of G/K. Let H be a reductive subgroup of G…
The notion of an automaton over a changing alphabet $X=(X_i)_{i\geq 1}$ is used to define and study automorphism groups of the tree $X^*$ of finite words over $X$. The concept of bi-reversibility for Mealy-type automata is extended to…
The operator Schmidt rank is the minimum number of terms required to express a state as a sum of elementary tensor factors. Here we provide a new proof of the fact that any bipartite mixed state with operator Schmidt rank two is separable,…
Recent work has highlighted the advantage of jointly learning grounded sentence representations from multiple languages. However, the data used in these studies has been limited to an aligned scenario: the same images annotated with…
We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this setting by allowing for orbit-finite unions instead of only finite ones. We prove…
Computer science students often struggle with abstract theoretical concepts, particularly in introductory courses on theoretical computer science. One such challenge is understanding context-free languages and their various representations.…
This paper introduces and studies a new model of computation called an Alternating Automatic Register Machine (AARM). An AARM possesses the basic features of a conventional register machine and an alternating Turing machine, but can carry…
In this letter, we used a combination of DEM and the multi-sphere method to investigate the random packing dynamics of $\Sigma_{2v}(2\pi/3)$-triplets. These triplets consist of three overlapping primary spheres, forming a bent structure…