相关论文: Free augmented LD-systems

Data augmentation is widely used for training a neural network given little labeled data. A common practice of augmentation training is applying a composition of multiple transformations sequentially to the data. Existing augmentation…

Let W~ be an affine Weyl group, and let C be a left, right, or two-sided Kazhdan--Lusztig cell in W~. Let Reduced (C) be the set of all reduced expressions of elements of C, regarded as a formal language in the sense of the theory of…

Alphabetic codes and binary search trees are combinatorial structures that abstract search procedures in ordered sets endowed with probability distributions. In this paper, we design new linear-time algorithms to construct alphabetic codes,…

Let S be a complete star-omega semiring and Sigma be an alphabet. For a weighted omega-pushdown automaton P with stateset 1...n, n greater or equal to 1, we show that there exists a mixed algebraic system over a complete semiring-semimodule…

In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set…

The set of points of a one-dimensional cut-and-project quasicrystal or model set, while not additive, is shown to be multiplicative for appropriate choices of acceptance windows. This leads to the definition of an associative additive…

For every finitely generated free group we construct an explicit left order extending the lexicographic order on the free monoid generated by the positive letters. The order is defined by a left, free action on the orbit of 0 of a free…

In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely generated additive monoid. A key to the proof is the definition…

We show that for any two distinct words $ s_1, s_2 $ over an arbitrary alphabets, there exists a deterministic finite automaton with $ O(\log^2 n) $ states that accepts $ s_1 $ and rejects $ s_2 $. This improves the previous upper bound of…

Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial…

Using methods of computer algebra, especially Gr\"obner bases for submodules of free modules over polynomial rings, we solve a classification problem in theory of algebraic operads: we show that the only nontrivial (possibly inhomogeneous)…

This paper introduces and systematically develops the theory of polyadic group rings, a higher arity generalization of classical group rings $\mathcal{R}[\mathsf{G}]$. We construct the fundamental operations of these structures, defining…

Large Language Models (LLMs) have advanced autonomous agents' planning and decision-making, yet they struggle with complex tasks requiring diverse expertise and multi-step reasoning. Multi-Agent Debate (MAD) systems, introduced in NLP…

A binary code is called a superimposed cover-free $(s,\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. A binary code is…

Motivated by the structure of the uniform posets we introduce the notion of an augmented down-up (or ADU) algebra. We discuss how ADU algebras are related to the down-up algebras defined by Benkart and Roby. For each ADU algebra we give two…

Let $\Omega$ be a finite set of finitary operation symbols. An $\Omega$-expanded group is a group (written additively and called the additive group of the $\Omega$-expanded group) with an $\Omega$-algebra structure. We use the black-box…

The aim of this paper is to summarize some recently obtained relations between the Ablowitz-Ladik hierarchy (ALH) and other integrable equations. It has been shown that solutions of finite subsystems of the ALH can be used to derive a wide…

This is a supplement to the paper "Liquidity based modeling of asset price bubbles via random matching". The supplement is organized as follows. First, we prove Theorem 3.13 in [1] which provides the existence of the dynamical system D…

Let $L$ be an algebra over a field $F$ with the binary operations $+$ and $[,]$. Then $L$ is called a left Leibniz algebra if it satisfies the left Leibniz identity: $[[a,b],c]=[a,[b,c]]-[b,[a,c]]$ for all elements $a,b,c\in L$. The…

We prove that the boundary dynamics of the (semi)group generated by the enriched dual transducer characterizes the algebraic property of being free for an automaton group. We specialize this result to the class of bireversible transducers…