English
Related papers

Related papers: On The Structure of Dyck Languages

200 papers

In this paper we study double cosets of finite rank free groups. We focus our attention on cancellation types in double cosets and their formal language properties.

Group Theory · Mathematics 2013-09-17 Elizaveta Frenkel , Vladimir N. Remeslennikov

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…

Group Theory · Mathematics 2015-10-09 Tara Brough

We show that a certain linear representation of the singular braid monoid on three strands is faithful. Furthermore we will give a second - group theoretically motivated - solution to the word problem in this monoid.

Geometric Topology · Mathematics 2007-05-23 Oliver T. Dasbach , Bernd Gemein

A monoid $S$ is said to be right coherent if every finitely generated subact of every finitely presented right $S$-act is finitely presented. Left coherency is defined dually and $S$ is coherent if it is both right and left coherent. These…

Rings and Algebras · Mathematics 2015-01-29 Victoria Gould , Miklos Hartmann , Nik Ruskuc

We prove that monoids $\mathrm{Mon}\langle a,b,c,d : a^nb=0, ac=1, db=1, dc=1, dab=1, da^2b=1, \ldots, da^{n-1}b=1\rangle$ are congruence-free for all $n\geq 1$. This provides a new countable family of finitely presented congruence-free…

Group Theory · Mathematics 2013-04-18 Alan J. Cain , Victor Maltcev , Abdullahi Umar

q-rook monoid algebras, Hecke algebras and Schur-Weyl duality

Representation Theory · Mathematics 2007-05-23 Tom Halverson , Arun Ram

Using a construction that builds a monoid from a monoid action, this paper exhibits an example of a direct product of monoids that admits a prefix-closed regular cross-section, but one of whose factors does not admit a regular…

Group Theory · Mathematics 2019-07-18 Tara Brough , Alan J. Cain , Victor Maltcev

We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…

Group Theory · Mathematics 2012-05-09 Patrick Dehornoy

Many formalisms combining ontology languages with uncertainty, usually in the form of probabilities, have been studied over the years. Most of these formalisms, however, assume that the probabilistic structure of the knowledge remains…

Artificial Intelligence · Computer Science 2015-06-29 İsmail İlkan Ceylan , Rafael Peñaloza

We give a new proof of Salvati's theorem that the group language $O_2$ is $2$ multiple context free. Unlike Salvati's proof, our arguments do not use any idea specific to two-dimensions. This raises the possibility that the argument might…

Formal Languages and Automata Theory · Computer Science 2017-11-01 Subhadip Chowdhury

We initiate the study of expansions of monoids in the class of two-sided restriction monoids and show that generalizations of the Birget-Rhodes prefix group expansion, despite the absence of involution, have rich structure close to that of…

Rings and Algebras · Mathematics 2024-10-29 Ganna Kudryavtseva

A free resolution of free partially commutative monoids is constructed and with its help the homological dimension of these monoids is calculated.

K-Theory and Homology · Mathematics 2007-05-23 Lyudmyla Yu. Polyakova

We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagrams annotated by objects and morphisms from the original…

Category Theory · Mathematics 2022-01-24 Antonin Delpeuch

We prove that the Parikh map of a bounded context-free language is a box spline. Moreover we prove that in this case, such a function is rational.

Discrete Mathematics · Computer Science 2008-07-08 Flavio D'Alessandro , Benedetto Intrigila , Stefano Varricchio

We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we demonstrate a context-free…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Özlem Salehi , Flavio D'Alessandro , A. C. Cem Say

We give a proof of the fact tha the subset of the rational curves form a closed analytic subset in the space of the 1-dimensional cycles of a complex space.

Complex Variables · Mathematics 2016-09-28 Daniel Barlet

We show that a transverse link in a contact structure supported by an open book decomposition can be transversely braided. We also generalize Markov's theorem on when the closures of two braids represent (transversely) isotopic links.

Geometric Topology · Mathematics 2015-03-13 Elena Pavelescu

The network characteristics based on the phonological similarities in the lexicons of several languages were examined. These languages differed widely in their history and linguistic structure, but commonalities in the network…

Physics and Society · Physics 2015-05-13 Samuel Arbesman , Steven H. Strogatz , Michael S. Vitevitch

We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…

Logic in Computer Science · Computer Science 2015-07-30 Charles Paperman

A monoid presentation is called special if the right-hand side of each defining relation is equal to 1. We prove results which relate the two-sided homological finiteness properties of a monoid defined by a special presentation with those…

Group Theory · Mathematics 2026-04-15 Robert D. Gray , Benjamin Steinberg