Related papers: Automata and one-dimensional TQFTs with defects
We consider general computational models: one-way and two-way finite automata, and logarithmic space Turing machines, all equipped with an auxiliary data structure (ADS). The definition of an ADS is based on the language of protocols of…
Traditional Turing machines are semantically poor, they only concern the syntactic manipulation of symbols, discarding the mathematical semantics behind the symbols. This semantic deficiency is considered the root cause of the three major…
We consider the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We show that given a language recognized by such a device and a linear context-free language, it is recursively decidable…
Starting from a Lie group G whose Lie algebra is equipped with an invariant nondegenerate symmetric bilinear form, we show that 4-dimensional BF theory with cosmological term gives rise to a TQFT satisfying a generalization of Atiyah's…
Quotient is a basic operation of formal languages, which plays a key role in the construction of minimal deterministic finite automata (DFA) and the universal automata. In this paper, we extend this operation to formal power series and…
We prove that, paying a polynomial increase in size only, every unrestricted two-way nondeterministic finite automaton (2NFA) can be complemented by a 1-limited automaton (1-LA), a nondeterministic extension of 2NFAs still characterizing…
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…
In the paper, we deal with the notion of an automaton over a changing alphabet, which generalizes the concept of a Mealy-type automaton. We modify the methods based on the idea of a dual automaton and its action used by B. Steinberg et al.…
We introduce Compositional Quantum Field Theory (CQFT) as an axiomatic model of Quantum Field Theory, based on the principles of locality and compositionality. Our model is a refinement of the axioms of General Boundary Quantum Field…
We present a state sum construction of two-dimensional extended Topological Quantum Field Theories (TQFTs), so-called open-closed TQFTs, which generalizes the state sum of Fukuma--Hosono--Kawai from triangulations of conventional…
The Arf-Brown invariant $\mathit{AB}(\Sigma)$ is an 8th root of unity associated to a surface $\Sigma$ equipped with a pin$^-$ structure. In this note we investigate a certain fully extended, invertible, topological quantum field theory…
Deterministic and nondeterministic finite automata with translucent letters were introduced by Nagy and Otto more than a decade ago as Cooperative Distributed systems of a kind of stateless restarting automata with window size one. These…
What comprises a global symmetry of a Quantum Field Theory (QFT) has been vastly expanded in the past 10 years to include not only symmetries acting on higher-dimensional defects, but also most recently symmetries which do not have an…
Topological duality defects arise as codimension one generalized symmetry operators in quantum field theories (QFTs) with a duality symmetry. Recent investigations have shown that in the case of 4D $\mathcal{N} = 4$ Super Yang-Mills (SYM)…
The problem of inclusion of the language accepted by timed automaton $A$ (e.g., the implementation) in the language accepted by $B$ (e.g., the specification) is, in general, undecidable in the class of non-deterministic timed automata. In…
The object of this paper is to define a subcategory of the category of 3-cobordisms to which invariants of rational homology 3-spheres should generalize. We specify the notion of Topological Quantum Field Theory (in the sense of Atiyah) to…
The modern approach to $m$-form global symmetries in a $d$-dimensional quantum field theory (QFT) entails specifying dimension $d-m-1$ topological generalized symmetry operators which non-trivially link with $m$-dimensional defect…
This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating…
Originating from the topology of the path-integral target space $Y$, solitonic symmetry describes the conservation law of topological solitons and the selection rule of defect operators. As Ref.~\cite{Chen:2022cyw} exemplifies, the…
We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with states and internal variables given by uninterpreted…