English
Related papers

Related papers: Context-free languages and associative algebras wi…

200 papers

A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…

Rings and Algebras · Mathematics 2017-08-04 Nathan BeDell

The paper demonstrates the non-closure of the family of unambiguous linear languages (that is, those defined by unambiguous linear context-free grammars) under complementation. To be precise, a particular unambiguous linear grammar is…

Formal Languages and Automata Theory · Computer Science 2022-10-06 Olga Martynova , Alexander Okhotin

We give in this paper a logical characterization for unambiguous Context Free Languages, in the vein of descriptive complexity. A fragment of the logic characterizing context free languages given by Lautemann, Schwentick and Th\'erien [18]…

Formal Languages and Automata Theory · Computer Science 2016-04-15 Yassine Hachaïchi

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

Combinatorics · Mathematics 2025-09-17 Nataša Jonoska , Francisco Martinez-Figueroa , Masahico Saito

Convergence spaces are a generalization of topological spaces. The category of convergence spaces is well-suited for Algebraic Topology, one of the reasons is the existence of exponential objects provided by continuous convergence. In this…

Algebraic Topology · Mathematics 2024-12-24 Rodrigo Santos Monteiro

We develop and explore the idea of recognition of languages (in the general sense of subsets of topological algebras) as preimages of clopen sets under continuous homomorphisms into Stone topological algebras. We obtain an Eilenberg…

Formal Languages and Automata Theory · Computer Science 2025-07-02 Jorge Almeida , Ondřej Klíma

We consider languages generated by weighted context-free grammars. It is shown that the behaviour of large texts is controlled by saddle-point equations for an appropriate generating function. We then consider ensembles of grammars, in…

Disordered Systems and Neural Networks · Physics 2022-10-03 Eric De Giuli

The objects of study in this paper are Hopf algebras $H$ which are finitely generated algebras over an algebraically closed field and are extensions of a commutative Hopf algebra by a finite dimensional Hopf algebra. Basic structural and…

Quantum Algebra · Mathematics 2019-07-25 Kenneth Brown , Miguel Couto

Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…

Group Theory · Mathematics 2018-04-24 Jorge Almeida , Alfredo Costa

Various limit-free formulas are given for the computation of the algebraic and the topological entropy, respectively in the settings of endomorphisms of locally finite discrete groups and of continuous endomorphisms of totally disconnected…

Dynamical Systems · Mathematics 2012-05-23 Dikran Dikranjan , Anna Giordano Bruno

We introduce context-free languages of morphisms in monoidal categories, extending recent work on the categorification of context-free languages, and regular languages of string diagrams. Context-free languages of string diagrams include…

Formal Languages and Automata Theory · Computer Science 2024-04-17 Matt Earnshaw , Mario Román

Hilbert evolution algebras generalize evolution algebras through a framework of Hilbert spaces. In this work we focus on infinite-dimensional Hilbert evolution algebras and their representation through a suitably defined weighted digraph.…

Rings and Algebras · Mathematics 2024-05-01 Paula Cadavid , Pablo M. Rodriguez , Sebastian J. Vidal

We give a computational approach to theorem proving in homological algebra. This approach is based on computations in the free abelian category of an additive category $\mathbf{A}$. We show that the free abelian category is amenable to…

Category Theory · Mathematics 2021-03-16 Sebastian Posur

In this paper, we consider graded associative conformal algebras. The class of these objects includes pseudo-algebras over non-cocommutative Hopf algebras of regular functions on some linear algebraic groups. In particular, an associative…

Quantum Algebra · Mathematics 2015-09-17 Pavel Kolesnikov

We introduce a family of maps parametrised by certain ribbon graphs. It is based on a connection in non-commutative geometry and contains the double divergence as a special case. Applying the construction to the case of the group algebra of…

Quantum Algebra · Mathematics 2025-02-20 Toyo Taniguchi

Since the early Sixties and Seventies it has been known that the regular and context-free languages are characterized by definability in the monadic second-order theory of certain structures. More recently, these descriptive…

cmp-lg · Computer Science 2016-08-31 James Rogers

For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…

K-Theory and Homology · Mathematics 2011-05-12 Vladimir Dotsenko , Anton Khoroshkin

Hilbert algebras with supremum, i.e., Hilbert algebras where the associated order is a join-semilattice were first considered by A.V. Figallo, G. Ramon and S. Saad in [11], and independently by S. Celani and D. Montangie in [7]. On the…

Logic · Mathematics 2013-08-01 Aldo V. Figallo , Elda Pick , Susana Saad , Martin Figallo

We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…

Rings and Algebras · Mathematics 2007-05-23 Vesselin Drensky , Lakhdar Hammoudi

This paper solves an open problem concerning the generative power of nonerasing context-free rewriting systems using a simple mechanism for checking for context dependencies, in the literature known as semi-conditional grammars of degree…

Formal Languages and Automata Theory · Computer Science 2010-04-22 Tomas Masopust
‹ Prev 1 3 4 5 6 7 10 Next ›