Related papers: Turing Automata and Graph Machines

We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of…

Tangle machines are topologically inspired diagrammatic models. Their novel feature is their natural notion of equivalence. Equivalent tangle machines may differ locally, but globally they are considered to share the same information…

Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting…

We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…

We introduce a natural generalization of the definition of a symmetric Hopf algebroid, internal to any symmetric monoidal category with coequalizers that commute with the monoidal product. Motivation for this is the study of Heisenberg…

A modular fusion category C allows one to define projective representations of the mapping class groups of closed surfaces of any genus. We show that if all these representations are irreducible, then C has a unique Morita-class of simple…

The pseudoinverse of a matrix, a generalized notion of the inverse, is of fundamental importance in linear algebra and, thereby, in many different fields. Despite its proven existence, an algorithmic approach is typically necessary to…

In this paper, we introduce the notion of a dual topological graph of a given topological graph, and show that it defines a C*-algebra isomorphic to the C*-algebra of the given one. Repeating to take a dual, and taking a projective limit,…

We consider algebras and Frobenius algebras, internal to a monoidal category, that are graded over a finite abelian group. For the case that A is a twisted group algebra in a linear abelian monoidal category we obtain a graded…

Computation models and specification methods seem to be worlds apart. The project on abstract state machines (in short ASMs, also known as evolving algebras) started as an attempt to bridge the gap by improving on Turing's thesis. We sought…

Matrix Graph Grammars (MGG) is a novel approach to the study of graph dynamics ([15]). In the present contribution we look at MGG as a formal grammar and as a model of computation, which is a necessary step in the more ambitious program of…

The paper is to classify irreducible integrable modules for the twisted full toroidal Lie algebra with some technical conditions. The twisted full toroidal Lie algebra are extensions of multiloop algebra twisted by sevaral finite order…

A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…

Let X be a product system over a quasi-lattice ordered group. Under mild hypotheses, we associate to X a C*-algebra which is co-universal for injective Nica covariant Toeplitz representations of X which preserve the gauge coaction. Under…

The degree spectrum of a countable structure is the set of all Turing degrees of presentations of that structure. We show that every nonlow Turing degree lies in the spectrum of some differentially closed field (of characteristic 0, with a…

Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…

Two novel computing models based on an infinite tessellation of space-time are introduced. They consist of recursively coupled primitive building blocks. The first model is a scale-invariant generalization of cellular automata, whereas the…

We introduce the notion of an algebraic cocycle as the algebraic analogue of a map to an Eilenberg-MacLane space. Using these cocycles we develop a ``cohomology theory" for complex algebraic varieties. The theory is bigraded, functorial,…

We extend the usual process-theoretic view on locality and causality in subsystems (based on the tensor product case) to general quantum systems (i.e.\ possibly non-factor, finite-dimensional von Neumann algebras). To do so, we introduce a…

A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any algebra of polynomials generated by quadratic monomials. The toric ideal of relations…