Related papers: Topological theories and automata
A mathematical framework of cohomological field theories (CohFTs) is formulated in the language of bigraded manifolds. Algebraic properties of operators in CohFTs are studied. Methods of constructing CohFTs, with or without gauge…
Our main result is that any topological algebra based on a Boolean space is the extended Stone dual space of a certain associated Boolean algebra with additional operations. A particular case of this result is that the profinite completion…
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…
The cohomology theory known as Tmf, for "topological modular forms," is a universal object mapping out to elliptic cohomology theories, and its coefficient ring is closely connected to the classical ring of modular forms. We extend this to…
One of the major open problems in automata and logic is the following: is there an algorithm which inputs a regular tree language and decides if the language can be defined in first-order logic? The goal of this paper is to present this…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic approach to model checking: a system is correct if the…
Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode…
We identify and examine a generalization of topological sigma models suitable for coupling to topological open strings. The targets are Kahler manifolds with a real structure, i.e. with an involution acting as a complex conjugation,…
This paper investigates the use of symmetric monoidal closed (SMC) structure for representing syntax with variable binding, in particular for languages with linear aspects. In our setting, one first specifies an SMC theory T, which may…
This work introduces topological regularization as a framework for handling ultraviolet divergences in quantum field theory, reinterpreting infinities as topological obstructions at spacetime boundaries. Through geometric compactification…
Weighted automata are a generalization of nondeterministic automata that associate a weight drawn from a semiring $K$ with every transition and every state. Their behaviours can be formalized either as weighted language equivalence or…
One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…
We explore the connections between automata, groups, limit spaces of self-similar actions, and tilings. In particular, we show how a group acting ``nicely'' on a tree gives rise to a self-covering of a topological groupoid, and how the…
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 prove that smooth 1-dimensional topological field theories over a manifold are equivalent to vector bundles with connection. The main novelty is our definition of the smooth 1-dimensional bordism category, which encodes cutting laws…
The Bar-Hillel construction is a classic result in formal language theory. It shows, by a simple construction, that the intersection of a context-free language and a regular language is itself context-free. In the construction, the regular…
Controlled commands -- computations whose execution depends on a separate input -- play a central role in reversible Boolean circuits and quantum circuits. However, existing formalisms typically treat control only implicitly, entangled with…
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…
We describe a class of topological field theories called ``balanced topological field theories.'' These theories are associated to moduli problems with vanishing virtual dimension and calculate the Euler character of various moduli spaces.…