Related papers: Parsing as a lifting problem and the Chomsky-Sch\"…
Theorems about characterization of finite rank Toeplitz operators in Fock-Segal-Bargmann spaces, known previously only for symbols with compact support, are carried over to symbols without that restriction, however with a rather rapid decay…
It is well known that Kleisli categories provide a natural language to model side effects. For instance, in the theory of coalgebras, behavioural equivalence coincides with language equivalence (instead of bisimilarity) when…
We describe two formalisms for defining graph languages, and prove that they are equivalent: 1. Separator logic. This is first-order logic on graphs which is allowed to use the edge relation, and for every $n \in \{0,1,\ldots \}$ a relation…
We give a new description of computads for weak globular $\omega$-categories by giving an explicit inductive definition of the free words. This yields a new understanding of computads, and allows a new definition of $\omega$-category that…
In this document, we propose a description, via a Haskell implementation, of a generalization of the notion of regular expression allowing us to group the definitions and the methods of (tree or word) automata constructions over one generic…
In the theory of operads we consider functors of generalized symmetric powers defined by sums of coinvariant modules under actions of symmetric groups. One observes classically that the construction of symmetric functors provides an…
This tutorial gives an advanced introduction to string diagrams and graph languages for higher-order computation. The subject matter develops in a principled way, starting from the two dimensional syntax of key categorical concepts such as…
In this paper, we investigate the expressive power and the algorithmic properties of weighted expressions, which define functions from finite words to integers. First, we consider a slight extension of an expression formalism, introduced by…
Many theories of semantic interpretation use lambda-term manipulation to compositionally compute the meaning of a sentence. These theories are usually implemented in a language such as Prolog that can simulate lambda-term operations with…
Given a braided pivotal category $\mathcal C$ and a pivotal module tensor category $\mathcal M$, we define a functor $\mathrm{Tr}_{\mathcal C}:\mathcal M \to \mathcal C$, called the associated categorified trace. By a result of…
In this paper, we propose a globally normalized model for context-free grammar (CFG)-based semantic parsing. Instead of predicting a probability, our model predicts a real-valued score at each step and does not suffer from the label bias…
An operad (this paper deals with non-symmetric operads)may be conceived as a partial algebra with a family of insertion operations, Gerstenhaber's circle-i products, which satisfy two kinds of associativity, one of them involving…
Context-free S grammars are introduced, for arbitrary (storage) type S, as a uniform framework for recursion-based grammars, automata, and transducers, viewed as programs. To each occurrence of a nonterminal of a context-free S grammar an…
The central role of the lexicon in Meaning-Text Theory (MTT) and other dependency-based linguistic theories cannot be replicated in linguistic theories based on context-free grammars (CFGs). We describe Tree Adjoining Grammar (TAG) as a…
In `free word order' languages, every sentence is embedded in its specific context. Among others, the order of constituents is determined by the categories `theme', `rheme' and `contrastive focus'. This paper shows how to recognise and to…
We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…
Let $G$ be a finitely generated group, and let $\Sigma$ be a finite subset that generates $G$ as a monoid. The \emph{word problem of $G$ with respect to $\Sigma$} consists of all words in the free monoid $\Sigma^{\ast}$ that are equal to…
The representation theory of 0-Hecke-Clifford algebras as a degenerate case is not semisimple and also with rich combinatorial meaning. Bergeron et al. have proved that the Grothendieck ring of the category of finitely generated…
Let M be a transitive model of set theory. There is a canonical interpretation functor between the category of regular Hausdorff, continuous open images of Cech-complete spaces of M and the same category in V, preserving many concepts of…
From the work of Bauer and Lesnick, it is known that there is no functor from the category of pointwise finite-dimensional persistence modules to the category of barcodes and overlap matchings. In this work, we introduce sub-barcodes and…