Related papers: Characterizing classes of regular languages using …
In this paper, we introduce a novel explicit family of subcodes of Reed-Solomon (RS) codes that efficiently achieve list decoding capacity with a constant output list size. Our approach builds upon the idea of large linear subcodes of RS…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
Inspired by a series of papers initiated in 2015 by Berth\'e et al., we introduce a new condition called suffix-connectedness. We show that the groups generated by the return sets of a uniformly recurrent suffix-connected language lie in a…
This paper provides a link between matroid theory and locally repairable codes (LRCs) that are either linear or more generally almost affine. Using this link, new results on both LRCs and matroid theory are derived. The parameters…
Let $\mathbb{k}$ be a characteristic zero domain. For a locally unital $\mathbb{k}$-superalgebra $A$ with distinguished idempotents $I$and even subalgebra $a \subseteq A_{\bar 0}$, we define and study an associated diagrammatic monoidal…
We establish an equivalence between two important random ensembles of linear codes: random linear codes (RLCs) and random Reed-Solomon (RS) codes. Specifically, we show that these models exhibit identical behavior with respect to key…
Given a unital action $\theta $ of an inverse monoid $S$ on an algebra $A$ over a filed $K$ we produce (co)homology spectral sequences which converge to the Hochschild (co)homology of the crossed product $A\rtimes_\theta S$ with values in a…
A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This paper gives a systematic analysis of the properties…
Difference hierarchies were originally introduced by Hausdorff and they play an important role in descriptive set theory. In this survey paper, we study difference hierarchies of regular languages. The first sections describe standard…
Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence related more general classes of regular…
A filtration of a formal language L by a sequence s maps L to the set of words formed by taking the letters of words of L indexed only by s. We consider the languages resulting from filtering by all arithmetic progressions. If L is regular,…
We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length $k$, no factor of length $k$ has more $a$'s than the prefix of the same length. These words arise in the context of…
Programs written in dynamic languages make heavy use of features --- run-time type tests, value-indexed dictionaries, polymorphism, and higher-order functions --- that are beyond the reach of type systems that employ either purely syntactic…
This paper is devoted to order-one explicit approximations of random periodic solutions to multiplicative noise driven stochastic differential equations (SDEs) with non-globally Lipschitz coefficients. The existence of the random periodic…
We establish strong well-posedness for a class of degenerate SDEs of kinetic type with autonomous diffusion driven by a symmetric $\alpha$-stable process under H\"older regularity conditions for the drift term. We partially recover the…
Traditionally, graph algorithms get a single graph as input, and then they should decide if this graph satisfies a certain property $\Phi$. What happens if this question is modified in a way that we get a possibly infinite family of graphs…
A prefix normal word is a binary word with the property that no substring has more $1$s than the prefix of the same length. By proving that the set of prefix normal words is a bubble language, we can exhaustively list all prefix normal…
We show regularity properties of local densities of solutions of stochastic differential equations (SDEs) with the Fourier analytic approach. With this simple method, statements that were previously derived with approaches using Malliavin…
We work with functions defined in R^n with values in a C^*- algebra A. We consider the set \Sa of the functions of Schwartz (the rapidly decreasing ones) with the usual l_2-norm. We denote \CB^{2n}A the set of functions of class C^\infty…
We study the language-theoretic aspects of the word problem, in the sense of Duncan & Gilman, of free products of semigroups and monoids. First, we provide algebraic tools for studying classes of languages known as super-AFLs, which…