English
Related papers

Related papers: Characterizing classes of regular languages using …

200 papers

Over the past years, Polar codes have arisen as a highly effective class of linear codes, equipped with a decoding algorithm of low computational complexity. This family of codes share a common algebraic formalism with the well-known…

Combinatorics · Mathematics 2024-06-17 Jicheng Ma , Guiying Yan

We give a natural-deduction-style type theory for symmetric monoidal categories whose judgmental structure directly represents morphisms with tensor products in their codomain as well as their domain. The syntax is inspired by Sweedler…

Category Theory · Mathematics 2021-07-13 Michael Shulman

The density of a rational language can be understood as the frequency of some "pattern" in the shift space, for example a pattern like "words with an even number of a given letter." We study the density of group languages, i.e. rational…

We investigate the intersection problem for finite monoids, which asks for a given set of regular languages, represented by recognizing morphisms to finite monoids from a variety V, whether there exists a word contained in their…

Formal Languages and Automata Theory · Computer Science 2018-02-05 Lukas Fleischer , Manfred Kufleitner

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

Formal Languages and Automata Theory · Computer Science 2025-02-12 Pranshu Gaba , Arnab Sur

In the paper we show that for a normal-crossings degeneration $Z$ over the ring of integers of a local field with $X$ as generic fibre, the local monodromy operator and its powers determine invariant cocycle classes under the decomposition…

Algebraic Geometry · Mathematics 2007-05-23 Caterina Consani

In this paper we introduce novel views of monoids and groups. More specifically, for a given set $S$, let $S^{S\times S}$ be the set of binary operations on $S$. We equip $S^{S\times S}$ with canonical binary operations induced by the…

Group Theory · Mathematics 2017-06-28 Masayoshi Kaneda

We identify a subclass of the regular commutative languages that is closed under the iterated shuffle, or shuffle closure. In particular, it is regularity-preserving on this subclass. This subclass contains the commutative group languages…

Formal Languages and Automata Theory · Computer Science 2021-08-19 Stefan Hoffmann

We address the problem of identifying a proof-theoretic framework that enables a compositional analysis of finite-trace properties in concurrent systems, with a particular focus on those specified via prefix-closure. To this end, we…

Logic in Computer Science · Computer Science 2025-12-08 Ludovico Fusco , Alessandro Aldini

We observe that on the level of derived categories, representations of the Lie algebra of a semisimple algebraic group over a field of characteristic $p> h$ (where $h$ is the Coxeter number), with a given (generalized) central character are…

Representation Theory · Mathematics 2007-05-23 Roman Bezrukavnikov , Ivan Mirković , Dmitriy Rumynin

We give an elementary characterization of those (abelian) semigroups $M$ that are direct limits of countable sequences of finite direct products of monoids of the form $C\cup\{0\}$ for monogenic groups $C$. This characterization involves…

Operator Algebras · Mathematics 2007-05-23 Enrique Pardo , Friedrich Wehrung

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

Group Theory · Mathematics 2018-01-16 Samuel J. v. Gool , B. Steinberg

We show that for large coupling delays the synchronizability of delay-coupled networks of identical units relates in a simple way to the spectral properties of the network topology. The master stability function used to determine stability…

Chaotic Dynamics · Physics 2011-12-21 V. Flunkert , S. Yanchuk , T. Dahms , E. Schöll

A class of linear block codes which simultaneously generalizes Gabidulin codes and a class of skew cyclic codes is defined. For these codes, both a Hartmann-Tzeng-like bound and a Roos-like bound, with respect to their rank distance, are…

Information Theory · Computer Science 2025-03-18 José Manuel Muñoz

In this paper we introduce the Sch\"utzenberger category $\mathbb D(S)$ of a semigroup $S$. It stands in relation to the Karoubi envelope (or Cauchy completion) of $S$ in the same way that Sch\"utzenberger groups do to maximal subgroups and…

Group Theory · Mathematics 2014-08-08 Alfredo Costa , Benjamin Steinberg

Lifted Reed Solomon Codes (Guo, Kopparty, Sudan 2013) were introduced in the context of locally correctable and testable codes. They are multivariate polynomials whose restriction to any line is a codeword of a Reed-Solomon code. We…

Information Theory · Computer Science 2020-07-30 Ray Li , Mary Wootters

We provide syntactic derivative-like operations, defined by recursion on regular expressions, in the styles of both Brzozowski and Antimirov, for trace closures of regular languages. Just as the Brzozowski and Antimirov derivative…

Formal Languages and Automata Theory · Computer Science 2019-08-12 Hendrik Maarand , Tarmo Uustalu

Separations among the first order logic ${\cal R}ing(0,+,*)$ of finite residue class rings, its extensions with generalized quantifiers, and in the presence of a built-in order are shown, using algebraic methods from class field theory.…

Logic in Computer Science · Computer Science 2025-07-08 Argimiro Arratia , Carlos E. Ortiz

Let H be a subgroup of some locally compact group G. Assume H is approximable by discrete subgroups and G admits neighborhood bases which are "almost-invariant" under conjugation by finite subsets of H. Let $m: G \to \mathbb{C}$ be a…

Classical Analysis and ODEs · Mathematics 2014-07-10 Martijn Caspers , Javier Parcet , Mathilde Perrin , Éric Ricard

Let $k$ be an algebraically closed field of characteristic zero, and let $\mathcal{C} = \mathcal{R}-mod$ be the category of finite-dimensional modules over a fixed Hopf algebra over $k$. One may form the wreath product categories…

Representation Theory · Mathematics 2018-10-29 Christopher Ryba