Related papers: Formal languages, spin systems, and quasicrystals
To Rogers (1994) we owe the insight that monadic second order predicate logic with multiple successors (MSO) is well suited in many respects as a realistic formal base for syntactic theorizing. However, the agreeable formal properties of…
Classical spin Hamiltonians are a powerful tool to model complex systems, characterised by a local structure given by the local Hamiltonians. One of the best understood local structures is the grammar of formal languages, which are central…
Weighted automata model quantitative aspects of systems like the consumption of resources during executions. Traditionally, the weights are assumed to form the algebraic structure of a semiring, but recently also other weight computations…
We address the question of identifying degrees of freedom for quantum systems. Typically, quasi-particle descriptions of correlated matter are based upon the canonical algebras of bosons or fermions. Here we highlight that a special class…
We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate…
We treat here the interrelation between formal languages and those dynamical systems that can be described by cellular automata (CA). There is a well-known injective map which identifies any CA-invariant subshift with a central formal…
I review the formalism of loop quantum gravity, in both its real and complex formulations, and spin foam theory which is its path integral counterpart. Spin networks for non-compact groups are introduced (following hep-th/0205268) to deal…
Context-free language theory is a subject of high importance in computer language processing technology as well as in formal language theory. This paper presents a formalization, using the Coq proof assistant, of fundamental results related…
This essay proposes an interpretive analogy between large language models (LLMs) and quasicrystals, systems that exhibit global coherence without periodic repetition, generated through local constraints. While LLMs are typically evaluated…
We propose a holographic dictionary which comes from reducing the bulk theories in an asymptotically flat spacetime to its null infinity. A general boundary theory is characterized by a fundamental field, an infinite tower of descendant…
We present a new proof that $O_2$ is a multiple context-free language. It contrasts with a recent proof by Salvati (2015) in its avoidance of concepts that seem specific to two-dimensional geometry, such as the complex exponential function.…
We study the problem of interacting theories with (partially)-massless and conformal higher spin fields without matter in three dimensions. A new class of theories that have partially-massless fields is found, which significantly extends…
This work constructs a well-defined and operational form factor expansion in a model having a massless spectrum of excitations. More precisely, the dynamic two-point functions in the massless regime of the XXZ spin-1/2 chain are expressed…
We introduce a normal form for context-free grammars, called Dyck normal form. This is a syntactical restriction of the Chomsky normal form, in which the two nonterminals occurring on the right-hand side of a rule are paired nonterminals.…
In this article, we provide three coalgebraic characterizations of the class of context-free languages, each based on the idea of adding coalgebraic structure to an existing algebraic structure by specifying output-derivative pairs. Final…
We investigate the structure of Large Language Model (LLM) embedding spaces using mathematical concepts, particularly linear algebra and the Hamiltonian formalism, drawing inspiration from analogies with quantum mechanical systems.…
Accurate modeling of spin-orbit coupling and noncollinear magnetism requires noncollinear density functionals within the two-component generalized Kohn-Sham (GKS) framework, yet constructing and implementing noncollinear functionals remains…
L systems generalise context-free grammars by incorporating parallel rewriting, and generate languages such as EDT0L and ET0L that are strictly contained in the class of indexed languages. In this paper we show that many of the languages…
A construction that assigns a Boolean 1D TQFT with defects to a finite state automaton was recently developed by Gustafson, Im, Kaldawy, Khovanov, and Lihn. We show that the construction is functorial with respect to the category of finite…
One of the possible approaches to the construction of massive higher spin interactions is to use their gauge invariant description based on the introduction of the appropriate set of Stueckelberg fields. Recently, the general properties of…