Related papers: A Bialgebraic Approach to Automata and Formal Lang…
Weighted automata are a generalization of nondeterministic automata that associate a weight drawn from a semiring $K$ with every transition and every state. Their behaviours can be formalized either as weighted language equivalence or…
Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…
These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical…
Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic…
Generally the study of algebraic deals with the concepts like groups, semigroups, groupoids, loops, rings, near-rings, semirings and vector spaces. The study of bialgebraic structures deals with the study of bistructures like bigroups,…
A Bialgebra is a module over a ring that is both an associative algebra and a co-associative coalgebra with the product and coproduct additionally satisfying an appropriate commutative relationship. One application of Bialgebras is in the…
Coalgebra is a currently quite active field, which aims to look at generic state-based systems (most prominently automata) from a very abstract point of view, mainly using tools from category theory. One of its achievements is to give a…
We introduce "synchronous algebras", an algebraic structure tailored to recognize automatic relations (aka. synchronous relations, or regular relations). They are the equivalent of monoids for regular languages, however they conceptually…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
The aim of the paper is to build a connection between two approaches towards categorical language theory: the coalgebraic and algebraic language theory for monads. For a pair of monads modelling the branching and the linear type we defined…
Automata admitting at most one accepting run per structure, known as unambiguous automata, find applications in verification of reactive systems as they extend the class of deterministic automata whilst maintaining some of their desirable…
In this article an interpretation and a proof of some classical \\theorems in analysis on the integration of analytic vectors fields are derived from the algebraic method of realization of bialgebras which are constructed with the data of a…
We endow the category of bialgebras over a pair of operads in distribution with a cofibrantly generated model category structure. We work in the category of chain complexes over a field of characteristic zero. We split our construction in…
The deformation bicomplex of a module-algebra over a bialgebra is constructed. It is then applied to study algebraic deformations in which both the module structure and the algebra structure are deformed. The cases of module-coalgebras,…
Turi and Plotkin's bialgebraic semantics is an abstract approach to specifying the operational semantics of a system, by means of a distributive law between its syntax (encoded as a monad) and its dynamics (an endofunctor). This setup is…
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…
We develop the bialgebra theory for two classes of non-associative algebras: nearly associative algebras and $LR$-algebras. In particular, building on recent studies that reveal connections between these algebraic structures, we establish…
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…
The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the determinized automaton and its semantics---languages over an…