English
Related papers

Related papers: Boolean TQFTs with accumulating defects, sofic sys…

200 papers

((1+1)-dimensional ${\cal N}=1$ super-symmetric field theory and (3+1)-dimensional ${\cal N}=2$ super-symmetric gauge theory are discussed in a, more or less, unified way, designed to identify the quantum BPS states in both systems.…

High Energy Physics - Theory · Physics 2016-02-29 Juan Mateos Guilarte

Quantum finite automata (QFAs) have been extensively studied in the literature. In this paper, we define and systematically study quantum B\"uchi automata (QBAs) over infinite words to model the long-term behavior of quantum systems, which…

Logic in Computer Science · Computer Science 2024-07-29 Qisheng Wang , Mingsheng Ying

In this paper, we introduce and explore a new model of {\it quantum finite automata} (QFA). Namely, {\it one-way finite automata with quantum and classical states} (1QCFA), a one way version of {\it two-way finite automata with quantum and…

Quantum Physics · Physics 2011-12-12 Shenggen Zheng , Daowen Qiu , Lvzhou Li , Jozef Gruska

We prove the following surprising result: there exist a 1-counter B\"uchi automaton and a 2-tape B\"uchi automaton such that the \omega-language of the first and the infinitary rational relation of the second in one model of ZFC are…

Logic in Computer Science · Computer Science 2015-07-01 Olivier Finkel

Topological defect lines (TDLs) are extended line operators which act on the Hilbert space of two-dimensional CFTs and satisfy non-trivial fusion algebras when forming junctions. Among the most interesting fusion algebras are the so-called…

High Energy Physics - Theory · Physics 2025-05-20 Babak Haghighat , Youran Sun

We consider a toy model of a 3-dimensional topological quantum gravity. In this model, a contribution of a given 3-manifold is given by the partition function of an abelian Topological Quantum Field Theory (TQFT), with a topological…

High Energy Physics - Theory · Physics 2025-08-05 Thomas Nicosanti , Pavel Putrov

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,…

Geometric Topology · Mathematics 2008-11-26 Dorin Cheptea , Thang T Q Le

We show how conformal field theory topological defects can relate solutions of open string field theory for different boundary conditions. To this end we generalize the results of Graham and Watts to include the action of defects on…

High Energy Physics - Theory · Physics 2016-12-08 Toshiko Kojita , Carlo Maccaferri , Toru Masuda , Martin Schnabl

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

If $f$ is an automorphism of a compact simply connected K\"ahler manifold with trivial canonical bundle that fixes a K\"ahler class, then the order of $f$ is finite. We apply this well known result to construct compact non-K\"ahler…

Algebraic Geometry · Mathematics 2012-11-30 Gunnar Þór Magnússon

This paper presents and analyzes an incremental algorithm for the construction of Acyclic Non-deterministic Finite-state Automata (NFA). Automata of this type are quite useful in computational linguistics, especially for storing lexicons.…

Data Structures and Algorithms · Computer Science 2007-05-23 Kyriakos N. Sgarbas , Nikos D. Fakotakis , George K. Kokkinakis

An $\omega$-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for $\omega$-tree-automatic structures. We prove…

Logic · Mathematics 2010-07-26 Olivier Finkel , Stevo Todorcevic

Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…

Formal Languages and Automata Theory · Computer Science 2023-04-12 Pierre Béaur , Benjamin Hellouin de Menibus

The two dimensional state sum models of Barrett and Tavares are extended to unoriented spacetimes. The input to the construction is an algebraic structure dubbed half twist algebras, a class of examples of which is real separable…

Quantum Algebra · Mathematics 2020-03-05 Alex Turzillo

In the classic problem of sequence prediction, a predictor receives a sequence of values from an emitter and tries to guess the next value before it appears. The predictor masters the emitter if there is a point after which all of the…

Formal Languages and Automata Theory · Computer Science 2016-03-09 Tim Smith

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…

High Energy Physics - Theory · Physics 2024-05-16 Ben Gripaios , Oscar Randal-Williams , Joseph Tooby-Smith

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

Formal Languages and Automata Theory · Computer Science 2019-10-17 Max Neunhöffer , Markus Pfeiffer , Nik Ruskuc

We introduce a many-body topological invariant, called the topological disorder parameter (TDP), to characterize gapped quantum phases with global internal symmetry in (2+1)d. TDP is defined as the constant correction that appears in the…

Strongly Correlated Electrons · Physics 2022-09-15 Bin-Bin Chen , Hong-Hao Tu , Zi Yang Meng , Meng Cheng

We define compact automata and show that every language has a unique minimal compact automaton. We also define recognition of languages by compact left semitopological monoids and construct the analogue of the syntactic monoid in this…

Formal Languages and Automata Theory · Computer Science 2013-06-07 Benjamin Steinberg

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…

Formal Languages and Automata Theory · Computer Science 2025-07-16 Bruno Guillon , Luca Prigioniero , Javad Taheri