Related papers: Boolean TQFTs with accumulating defects, sofic sys…
A data language is a set of finite words defined on an infinite alphabet. Data languages are used to express properties associated with data values (domain defined over a countably infinite set). In this paper, we introduce set augmented…
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean algebras, with special attention to quantifier-eliminations, complete axiomatizations and decidability. A classical example is the enrichment…
In connection with the results of Tim Austin, and Wen Huang, Song Shao, Xiangdong Ye we present the following assertion: there are infinite automorphisms $S,T$, some set $A$ of positive finite measure and a sequence $N_m$ with…
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…
We study the set of boundary orbit accumulation points of the automorphism group action on a bounded domain in $\CC^n$. Topological and geometric properties of this set are derived.
Stochastic automata over monoids as input sets are studied. The well-definedness of these automata requires an extension postulate that replaces the inherent universal property of free monoids. As a generalization of Turakainen's result, it…
Using recent developments in coalgebraic and monad-based semantics, we present a uniform study of various notions of machines, e.g. finite state machines, multi-stack machines, Turing machines, valence automata, and weighted automata. They…
We initiate a systematic study of 3-dimensional `defect' topological quantum field theories, that we introduce as symmetric monoidal functors on stratified and decorated bordisms. For every such functor we construct a tricategory with…
The interpretation of D-branes in terms of open strings has lead to much interest in boundary conditions of two-dimensional conformal field theories (CFTs). These studies have deepened our understanding of CFT and allowed us to develop new…
Let $\Sigma$ and $\bar\Sigma$ be finite alphabets. For topologically transitive sofic systems $ X\subset \Sigma^{\Bbb Z}$ and $\widetilde X\subset \widetilde\Sigma^{\Bbb Z}$ we give a necessary and sufficient condition for the existence of…
Domain walls, strings and monopoles are extended objects, or defects, of quantum origin with topologically non--trivial properties and macroscopic behavior. They are described in Quantum Field Theory in terms of inhomogeneous condensates.…
In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity. We prove that for two DFAs with the same number of states BC-complexity can differ…
In this paper we survey some surprising connections between group theory, the theory of automata and formal languages, the theory of ends, infinite games of perfect information, and monadic second-order logic.
We define a quantum computational model over infinite words, called Measure-Many Quantum B\"uchi Automata (MMQBA), which extends Measure-many Quantum Finite automata (MMQFA) to the infinite word setting with B\"uchi acceptance condition. In…
We study dynamical systems with the property that all the nontrivial factors have infinite topological entropy (or, positive mean dimension). We establish an ``if and only if'' condition for this property among a typical class of dynamical…
The paper studies the Karoubi envelope of a one-dimensional topological theory with defects and inner endpoints, defined over a field. It turns out that the Karoubi envelope is determined by a symmetric Frobenius algebra K associated to the…
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Measure Once Quantum Finite Automata (MO-QFA). We study the injectivity problem of determining if the acceptance probability function of a…
A generalised orbifold of a defect TQFT $\mathcal{Z}$ is another TQFT $\mathcal{Z}_{\mathcal{A}}$ obtained by performing a state sum construction internal to $\mathcal{Z}$. As an input it needs a so-called orbifold datum $\mathcal{A}$ which…
We revisit the complexity of procedures on SFAs (such as intersection, emptiness, etc.) and analyze them according to the measures we find suitable for symbolic automata: the number of states, the maximal number of transitions exiting a…