Related papers: Bounded Languages Described by GF(2)-grammars
Clans are representations of generalized algebraic theories that contain more information than the finite-limit categories associated to the locally finitely presentable categories of models via Gabriel-Ulmer duality. Extending…
Regular languages (RL) are the simplest family in Chomsky's hierarchy. Thanks to their simplicity they enjoy various nice algebraic and logic properties that have been successfully exploited in many application fields. Practically all of…
Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…
In the principles-and-parameters framework, the structural features of languages depend on parameters that may be toggled on or off, with a single parameter often dictating the status of multiple features. The implied covariance between…
A graph $\Gamma$ labelled by a set $S$ defines a group $G(\Gamma)$ whose generators are the set of labels $S$ and whose relations are all words which can be read on closed paths of this graph. We introduce the notion of aspherical graph and…
Large, pretrained language models infer powerful representations that encode rich semantic and syntactic content, albeit implicitly. In this work we introduce a novel neural language model that enforces, via inductive biases, explicit…
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining Grammars (FB-LTAGs), a…
Graph neural networks (GNNs) have proven their efficacy in a variety of real-world applications, but their underlying mechanisms remain a mystery. To address this challenge and enable reliable decision-making, many GNN explainers have been…
We explore a family of nested recurrence relations with arbitrary levels of nesting, which have an interpretation in terms of fixed points of morphisms over a countably infinite alphabet. Recurrences in this family are related to a number…
Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In this paper, we…
Let D denote an infinite alphabet -- a set that consists of infinitely many symbols. A word w = a_0 b_0 a_1 b_1 ... a_n b_n of even length over D can be viewed as a directed graph G_w whose vertices are the symbols that appear in w, and the…
We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disentailment for the GRAMMAR constraint in these cases is as…
The graph programming language GP 2 allows to apply sets of rule schemata (or "attributed" rules) non-deterministically. To analyse conflicts of programs statically, graphs labelled with expressions are overlayed to construct critical pairs…
Lexical ambiguity presents a profound and enduring challenge to the language sciences. Researchers for decades have grappled with the problem of how language users learn, represent and process words with more than one meaning. Our work…
Frames are the most natural generalization of orthonormal bases that allow the inclusion of redundant systems. In this article, we introduce the concept of frames generated by graphs in finite-dimensional spaces and study their properties.…
We present a new graph compressor that works by recursively detecting repeated substructures and representing them through grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other…
Duality between the coloured quantum group and the coloured quantum algebra corresponding to GL(2) is established. The coloured L^{\pm} functionals are constructed and the dual algebra is derived explicitly. These functionals are then…
We study the boundedness of families of algebraic flat connections with bounded irregularity. As an application, we study the boundedness of families of holonomic $D$-modules with dominated characteristic cycles.
Incorporating prior knowledge like lexical constraints into the model's output to generate meaningful and coherent sentences has many applications in dialogue system, machine translation, image captioning, etc. However, existing RNN-based…
We consider the class of languages defined in the 2-variable fragment of the first-order logic of the linear order. Many interesting characterizations of this class are known, as well as the fact that restricting the number of quantifier…