Related papers: Formal Languages and TQFTs with Defects
This paper describes an abstract machine for linguistic formalisms that are based on typed feature structures, such as HPSG. The core design of the abstract machine is given in detail, including the compilation process from a high-level…
Motivated by recent connections to factorised databases, we analyse the efficiency of representations by context free grammars (CFGs). Concretely, we prove a recent conjecture by Kimelfeld, Martens, and Niewerth (ICDT 2025), that for finite…
There are two methods to study families of conformal theories in the operator formalism. In the first method we begin with a theory and a family of deformed theories is defined in the state space of the original theory. In the other there…
Dynamical quantum field theories (QFTs), such as those in which spacetimes are equipped with a metric and/or a field in the form of a smooth map to a target manifold, can be formulated axiomatically using the language of…
Defects in conformal field theories are interesting objects to study from both formal and applied points of view. In this paper, we construct conformal defects in free scalar field CFTs in diverse dimensions. After discussing the possible…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
Topological defect lines (TDLs) in two-dimensional conformal field theories (CFTs) are standard examples of generalized symmetries in quantum field theory. Integrable lattice incarnations of these TDLs, such as those provided by…
Neural Network Field Theories (NN-FTs) represent a novel construction of arbitrary field theories, including those of conformal fields, through the specification of the network architecture and prior distribution for the network parameters.…
We develop a theory of Hrushovski-Kazhdan style motivic integration for certain type of non-archimedean o-minimal fields, namely polynomial-bounded T-convex valued fields. The structure of valued fields is expressed through a two-sorted…
This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over…
The 2-way quantum finite automaton introduced by Kondacs and Watrous can accept non-regular languages with bounded error in polynomial time. If we restrict the head of the automaton to moving classically and to moving only in one direction,…
A topological defect network (TDN) is formed by a network of topological defects embedded within a topological quantum field theory (TQFT). TDNs were introduced recently for the purpose of describing fracton topological phases of matter…
In this paper, we construct new models for the Anderson duals $(I\Omega^G)^*$ to the stable tangential $G$-bordism theories and their differential extensions. The cohomology theory $(I\Omega^G)^*$ is conjectured by Freed and Hopkins [FH21]…
In this paper, we prove that a class of regular sequences can be viewed as projections of fixed points of uniform morphisms on a countable alphabet, and also can be generated by countable states automata. Moreover, we prove that the…
An important problem in applications of quasiconformal analysis and in its numerical aspect is to establish algorithms for explicit or approximate determination of the basic quasiinvariant curvelinear and analytic functionals intrinsically…
Using recent developments in coalgebraic and monad-based semantics, we present a uniform study of various notions of machines, e.g. finite state machines, multi-stack machines, Turing machines, valence automata, and weighted automata. They…
This paper describes a first step towards the definition of an abstract machine for linguistic formalisms that are based on typed feature structures, such as HPSG. The core design of the abstract machine is given in detail, including the…
Partially ordered automata are automata where the transition relation induces a partial order on states. The expressive power of partially ordered automata is closely related to the expressivity of fragments of first-order logic on finite…
The standard, gapped entanglement boundary condition in Chern Simons theory breaks the topological invariance of the theory by introducing a complex structure on the entangling surface. This produces an infinite dimensional subregion…
We derive a canonical form for 2-group gauge theory in 3+1D which shows they are either equivalent to Dijkgraaf-Witten theory or to the so-called "EF1" topological order of Lan-Wen. According to that classification, recently argued from a…