Related papers: Boolean TQFTs with accumulating defects, sofic sys…
To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$ which arises from a combinatorial game played on the language of $X$. Previously it has been studied what properties of $X$ does $W(X)$ inherit. For example, $X$…
First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…
We construct two-dimensional non-commutative topological quantum field theories (TQFTs), one for each Hecke algebra corresponding to a finite Coxeter system. These TQFTs associate an invariant to each ciliated surface, which is a Laurent…
The algebraic structure of representation theory naturally arises from 2D fixed-point tensor network states, which conceptually formulates the pattern of long-range entanglement realized in such states. In 3D, the same underlying structure…
Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…
The concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced. The resulting conditional set theory is sufficiently rich in order to construct a conditional topology, a conditional…
Given a Probabilistic Finite Automata (PFA), a set of states S, and an error threshold e > 0, our algorithm approximates the infimum probability (quantifying over all infinite words) that the automata reaches S. Our result contrasts with…
We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word.
We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length $\varTheta(n^2)$, where…
Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility of a unified formalism. We propose finite states…
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…
We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata)…
An S-adic expansion of an infinite word is a way of writing it as the limit of an infinite product of substitutions (i.e., morphisms of a free monoid). Such a description is related to continued fraction expansions of numbers and vectors. A…
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,…
Within the framework of relative and absolute quantum field theories (QFTs), we present a general formalism for understanding polarizations of the intermediate defect group and constructing non-invertible duality defects in theories in $2k$…
One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a local, shift-invariant unitary evolution. By local we mean that no…
Two singularity theorems can be proven if one attempts to let a Lorentzian cobordism interpolate between two topologically distinct manifolds. On the other hand, Cartier and DeWitt-Morette have given a rigorous definition for quantum field…
This paper contains results related to synthesis and presentation of abstract automata by fragments of behaviour and investigates the structure of the classes of finite connected initial output-less automata specified by systems of defining…
A classical result in quantum topology is that oriented 2-dimensional topological quantum field theories (2-TQFTs) are fully classified by commutative Frobenius algebras. In 2006, Turaev and Turner introduced additional structure on…
We survey recent results on multiple transitivity of automorphism groups of affine algebraic varieties. We consider the property of infinite transitivity of the special automorphism group, which is equivalent to flexibility of the…