Related papers: A Bialgebraic Approach to Automata and Formal Lang…
The paper explains the connection between topological theories for one-manifolds with defects and values in the Boolean semiring and automata and their generalizations. Finite state automata are closely related to regular languages. To each…
A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for formalizing algorithms that manipulate mathematical expressions. A theory…
Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…
We describe the problem of Sweedler's duals for bialgebras as essentially characterizing the domain of the transpose of the multiplication. This domain is the set of what could be called ``representative linear forms'' which are the…
Language theory, symbolic dynamics, modelisation of viral insertion into the genetic code of a host cell motivate the introduction of new types of bialgebras whose coalgebra parts are not necessarily coassociative. One of the aim of this…
Information algebras arise from the idea that information comes in pieces which can be aggregated or combined into new pieces, that information refers to questions and that from any piece of information, the part relevant to a given…
A classical theorem states that the set of languages given by a pushdown automaton coincides with the set of languages given by a context-free grammar. In previous work, we proved the pendant of this theorem in a setting with interaction:…
We develop the basic constructions of homological algebra in the (appropriately defined) unbounded derived categories of modules over algebras over coalgebras over noncommutative rings (which we call semialgebras over corings). We define…
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,…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
In this book i treat linear algebra over division ring. A system of linear equations over a division ring has properties similar to properties of a system of linear equations over a field. However, noncommutativity of a product creates a…
A Rota-Baxter Leibniz algebra is a Leibniz algebra $(\mathfrak{g},[~,~]_{\mathfrak{g}})$ equipped with a Rota-Baxter operator $T : \mathfrak{g} \rightarrow \mathfrak{g}$. We define representation and dual representation of Rota-Baxter…
Bialgebras and Hopf (bi)modules are typical algebraic structures with several interacting operations. Their structural and homological study is therefore quite involved. We develop the machinery of braided systems, tailored for handling…
We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…
The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powerset construction from automata to the more general framework…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
We introduce a notion of pre-alternative algebra which may be seen as an alternative algebra whose product can be decomposed into two pieces which are compatible in a certain way. It is also the "alternative" analogue of a dendriform…
We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic, introduced within a research program developing logical…
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
Autoformalization has emerged as a term referring to the automation of formalization - specifically, the formalization of mathematics using interactive theorem provers (proof assistants). Its rapid development has been driven by progress in…