Related papers: Boolean TQFTs with accumulating defects, sofic sys…
We consider $\omega^n$-automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length $\omega^n$ for some integer $n\geq 1$. We show that all these structures are…
We examine questions involving nondeterministic finite automata where all states are final, initial, or both initial and final. First, we prove hardness results for the nonuniversality and inequivalence problems for these NFAs. Next, we…
We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…
Traditionally, finite automata theory has been used as a framework for the representation of possibly infinite sets of strings. In this work, we introduce the notion of second-order finite automata, a formalism that combines finite automata…
A countably infinite Boolean inverse monoid that can be written as an increasing union of finite Boolean inverse monoids (suitably embedded) is said to be of finite type. Borrowing terminology from $C^{\ast}$-algebra theory, we say that…
We deal with several pcf problems; we characterize another version of exponentiation: number of kappa-branches in a tree with lambda nodes, deal with existence of independent sets in stable theories, possible cardinality of ultraproduct,…
Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence related more general classes of regular…
We construct extended TQFTs associated to Rozansky--Witten models with target manifolds $T^*\mathbb{C}^n$. The starting point of the construction is the 3-category whose objects are such Rozansky--Witten models, and whose morphisms are…
We give a finite presentation of the cobordism symmetric monoidal bicategory of (smooth, oriented) closed manifolds, cobordisms and cobordisms with corners as an extension of the bicategory of closed manifolds, cobordisms and…
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 give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
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…
A sofic approximation to a countable group is a sequence of partial actions on finite sets that asymptotically approximates the action of the group on itself by left-translations. A group is sofic if it admits a sofic approximation. Sofic…
In finite volume the partition function of QCD with a given $\theta$ is a sum of different topological sectors with a weight primarily determined by the topological susceptibility. If a physical observable is evaluated only in a fixed…
We prove that for any superatomic Boolean Algebra of cardinality >beth_omega there is an automorphism moving uncountably many atoms. Similarly for larger cardinals. Any of those results are essentially best possible.
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, B\"uchi, coB\"uchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and…
Unambiguous non-deterministic finite automata have intermediate expressive power and succinctness between deterministic and non-deterministic automata. It has been conjectured that every unambiguous non-deterministic one-way finite…
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 orbifold construction via topological defects in quantum field theory can either be understood as a state sum construction internal to a given ambient theory, or as the procedure of (identifying and) gauging ordinary and…