Related papers: Formal languages, spin systems, and quasicrystals
We give a mathematical framework to describe the evolution of an open quantum systems subjected to finitely many interactions with classical apparatuses. The systems in question may be composed of distinct, spatially separated subsystems…
We study states of one- and two-dimensional spin systems that are constructed as correlators within the conformal field theory of a massless, free boson. In one dimension, these are good variational wave functions for XXZ spin chains and…
We show that spin systems with generic (ferro- or paramagnetic, or random) interactions are "completely integrable". The approach is worked out, by way of example, for the Sherrington Kirkpatrick model: we derive an exact, closed formula…
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…
We present a novel parsing algorithm for all context-free languages, based on computing the relation between configurations and reaching transitions in a recursive transition network. Parsing complexity w.r.t. input length matches the state…
Large N quasi-fermionic Chern-Simons-matter theories have an approximate higher-spin symmetry that strongly constrains their correlation functions. In particular, the 3-point functions for generic spins are combinations of 3 structures…
First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…
We introduce the orthogonal Grassmannian as a novel kinematic space for describing correlators of massless spinning fields in de Sitter space. By automatically encoding the constraints of conformal symmetry and current conservation, the…
We introduce a meta-model based on formal languages, dubbed formal choreographic languages, to study message-passing systems. Our framework allows us to generalise standard constructions from the literature and to compare them. In…
Constraint logic grammars provide a powerful formalism for expressing complex logical descriptions of natural language phenomena in exact terms. Describing some of these phenomena may, however, require some form of graded distinctions which…
We present new descriptive complexity characterisations of classes REG (regular languages), LCFL (linear context-free languages) and CFL (context-free languages) as restrictions on inference rules, size of formulae and permitted connectives…
This thesis is an elaboration of recent results on the holographic re-construction of metric-like interactions in higher-spin gauge theories on anti-de Sitter space (AdS), employing their conjectured holographic duality with free conformal…
This paper describes a computational framework for a grammar architecture in which different linguistic domains such as morphology, syntax, and semantics are treated not as separate components but compositional domains. Word and phrase…
We study multitoken interaction machines in the context of a very expressive logical system with exponentials, fixpoints and synchronization. The advantage of such machines is to provide models in the style of the Geometry of Interaction,…
This expository article sets forth a self-contained and purely algebraic proof of a deep result of Quillen stating that the category of simplicial commutative algebras over a commutative ring is a model category. This is accomplished by…
The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
We develop a general formalism of duality rotations for bosonic conformal spin-$s$ gauge fields, with $s\geq 2$, in a conformally flat four-dimensional spacetime. In the $s=1$ case this formalism is equivalent to the theory of…
Context-free session types provide a typing discipline for recursive structured communication protocols on bidirectional channels. They overcome the restriction of regular session type systems to tail recursive protocols. This extension…
The vectorial holographic correspondences between higher-spin theories in AdS$_5$ and free vector models on the boundary are extended to the cases where the latter is described by free massless spin-$j$ field. The dual higher-spin theory in…