Related papers: Automata and one-dimensional TQFTs with defects
The paper explains the connection between topological theories for one-manifolds with defects and values in the Boolean semiring and automata and their generalizations. Finite state automata are closely related to regular languages. To each…
Any finite state automaton gives rise to a Boolean one-dimensional TQFT with defects and inner endpoints of cobordisms. This paper extends the correspondence to Boolean TQFTs where defects accumulate toward inner endpoints, relating such…
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…
We construct a Topological Quantum Field Theory (in the sense of Atiyah) associated to the universal finite-type invariant of 3-dimensional manifolds, as a functor from the category of 3-dimensional manifolds with parametrized boundary,…
We study boundary conditions for extended topological quantum field theories (TQFTs) and their relation to topological anomalies. We introduce the notion of TQFTs with moduli level $m$, and describe extended anomalous theories as natural…
In this paper we give automata-based representation of LTL-FO$^+$ properties. LTL-FO$^+$ is an extension of LTL that includes first-order quantification over bounded variable, thus greatly increasing the expressivity of the language. An…
We introduce the notion of $n$-dimensional topological quantum field theory (TQFT) with defects as a symmetric monoidal functor on decorated stratified bordisms of dimension $n$. The familiar closed or open-closed TQFTs are special cases of…
Performing topological manipulations is a fruitful way to understand global aspects of Quantum Field Theory (QFT). Such modifications are typically controlled by the notion of Topological QFT (TQFT) coupling across different codimensions.…
(Talk presented at the XVth Workshop on Geometric Methods in Physics, Quantizations, Deformations and Coherent States, in Bialowieza, Poland, July 1-7, 1996.) The aim of this article is to introduce some basic notions of Topological Quantum…
We cast new light on the existing models of one-way deterministic topological automata by introducing a fresh but general, convenient model, in which, as each input symbol is read, an interior system of an automaton, known as a…
A quantum finite-state automaton (QFA) is a theoretical model designed to simulate the evolution of a quantum system with finite memory in response to sequential input strings. We define the language of a QFA as the set of strings that lead…
In this paper, we present a construction toward a new type of TQFTs at the crossroads of low-dimensional topology, algebraic geometry, physics, and homotopy theory. It assigns TMF-modules to closed 3-manifolds and maps of TMF-modules to…
We introduce regular stratified piecewise linear manifolds to describe lattices and investigate the lattice model approach to topological quantum field theory in all dimensions. We introduce the unitary $n+1$ alterfold TQFT and construct it…
This is a brief introduction to link homology theories that categorify Reshetikhin--Turaev $\mathsf{SL}(N)$-quantum link invariants. A recently discovered surprising connection between finite state automata and Boolean TQFTs in dimension…
Let L:= Z^D be the D-dimensional lattice and let A^L be the Cantor space of L-indexed configurations in some finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F of A^L,…
A 3-dimensional topological quantum field theory (TQFT) is a symmetric monoidal functor from the category of 3-cobordisms to the category of vector spaces. Such TQFTs provide in particular numerical invariants of closed 3-manifolds such as…
In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata by A.Kondacs and J.Watrous. The well-formedness conditions for…
We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also,…
Symbolic automata are finite state automata that support potentially infinite alphabets, such as the set of rational numbers, generally applied to regular expressions/languages over finite words. In symbolic automata (or automata modulo…
1-way quantum finite state automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by 1-way quantum finite automata is a proper subset of regular languages. We introduce 2-tape…