Related papers: A Bialgebraic Approach to Automata and Formal Lang…
Delta lenses are a kind of morphism between categories which are used to model bidirectional transformations between systems. Classical state-based lenses, also known as very well-behaved lenses, are both algebras for a monad and coalgebras…
We establish a dictionary between the Cacti algebra axioms on a Cacti algebra structure with underlying free associative algebra, under suitable good behavior with degrees. Using these ideas, for an associative algebra $A$ and a bialgebra…
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 specifying and reasoning about algorithms that manipulate mathematical…
We give here a review of results about double bialgebras, that is to say bialgebras with two coproducts, the first one being a comodule morphism for the coaction induced by the second one. An accent is put on the case of connected…
In this paper a finite dimensional unital associative algebra is presented, and its group of algebra automorphisms is detailed. The studied algebra can physically be understood as the creation operator algebra in a formal quantum field…
This paper is a coalgebra version of arXiv:1703.04266 and a sequel to arXiv:1607.03066. We present the definition of a pseudo-dualizing complex of bicomodules over a pair of coassociative coalgebras $\mathcal C$ and $\mathcal D$. For any…
Formal grammars are extensively used in Computer Science and related fields to study the rules which govern production of a language. The use of these grammars can be extended beyond mere language production. One possibility is to view…
We use the theory of bialgebras to provide the algebraic background for state space realization theorems for input-output maps of control systems. This allows us to consider from a common viewpoint classical results about formal state space…
Automata learning is a popular technique used to automatically construct an automaton model from queries. Much research went into devising ad hoc adaptations of algorithms for different types of automata. The CALF project seeks to unify…
A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is…
In our paper Semi-symmetric Algebras: General Constructions, J. Algebra, 148 (1992), pp. 479-496, we present the construction of the semi-symmetric algebra of a module over a commutative ring with unit, which generalizes the tensor algebra,…
Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgebraic or coinductive representation as infinite tries, i.e., prefix trees branching over the alphabet, has been used to obtain compact and…
We study different algebraic structures associated to an operad and their relations: to any operad $\mathbf{P}$ is attached a bialgebra,the monoid of characters of this bialgebra, the underlying pre-Lie algebra and its enveloping algebra;…
A description of a ring of functions on the base of a universal formal deformation for several moduli problems is given. The answer is given in terms of a homology group of a certain dg Lie algebra canonically (up to an essentially unique…
This paper introduces a categorification of $k$-algebras called 2 -algebras, where k is a commutative ring. We define the 2-algebras as a 2-category with single object in which collections of all 1-morphisms and all 2-morphisms are…
We describe some connections between three different fields: combinatorics (umbral calculus), functional analysis (linear functionals and operators) and harmonic analysis (convolutions on group-like structures). Systematic usage of…
Currently there is great interest in computational models consisting of underlying regular computational environments, and built on them distributed computational structures. Examples of such models are cellular automata, spatial…
We consider weighted automata over words and over trees where the weight algebras are strong bimonoids, i.e., semirings which may lack distributivity. It is well known that, for each such weighted automaton, its run semantics and its…
In this paper, we study compatible Leibniz algebras. We characterize compatible Leibniz algebras in terms of Maurer-Cartan elements of a suitable differential graded Lie algebra. We define a cohomology theory of compatible Leibniz algebras…
This paper is based on the material of Section 4 and Appendix C in arXiv:1503.05523v6, which was excluded from the subsequent versions of arXiv:1503.05523. We present the definition of a dedualizing complex of bicomodules over a pair of…