Related papers: The linear nature of pseudowords

Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…

It is proved that each of compact linear groups of one special type admits a semialgebraic continuous factorization map onto a real vector space.

Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…

First introduced in the study of the Sturmian words, the iterated palindromic closure was recently generalized to pseudopalindromes. This operator allows one to construct words with an infinity of pseudopalindromic prefixes, called…

Computational interpretations of linear logic allow static control of memory resources: the data produced by the program are endowed through its type with attributes that determine its life cycle, and guarantee safe deallocation. The use of…

We show that the derived subgroup of a linear definable group in an o-minimal structure is also definable, extending the semialgebraic case proved by A. Pillay. We also show the definability of the derived subgroup in case that the group is…

We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we had introduced the distinction between periodic and…

We show that the pointlike and the idempotent pointlike problems are reducible with respect to natural signatures in the following cases: the pseudovariety of all finite semigroups in which the order of every subgroup is a product of…

In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a…

Unsupervised word segmentation in audio utterances is challenging as, in speech, there is typically no gap between words. In a preliminary experiment, we show that recent deep self-supervised features are very effective for word…

We discuss a general method by which a higher order difference equation on a group is transformed into an equivalent triangular system of two difference equations of lower orders. This breakdown into lower order equations is based on the…

We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

In various places in the literature it is stated that every separable linear order embeds into the real line. This is, however, not the case, at least not with respect to the usual definition of separability. We correct this misconception.

A semigroup together with compatible partial order is called an odered semigroup. In this paper we discuss the ordered matrix semigroups.

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

While self-training has advanced semi-supervised semantic segmentation, it severely suffers from the long-tailed class distribution on real-world semantic segmentation datasets that make the pseudo-labeled data bias toward majority classes.…

We define a class of singularity on arbitrary pairs of a normal variety and an effective $\mathbb{R}$-divisor on it, which we call pseudo-lc in this paper. This is a generalization of the usual lc singularity of pairs and log canonical…

We introduce sound and complete labelled sequent calculi for the basic normal non-distributive modal logic L and some of its axiomatic extensions, where the labels are atomic formulas of the first order language of enriched formal contexts,…

We establish that, under certain closure assumptions on a pseudovariety of semigroups, the corresponding relatively free profinite semigroups freely generated by a non-singleton finite set act faithfully on their minimum ideals. As…