A Bialgebraic Approach to Automata and Formal Language Theory

TL;DR

This paper explores the application of bialgebra structures to automata and formal language theory within categories of semimodules over semirings, revealing deep connections and new constructions in the field.

Contribution

It introduces a bialgebraic framework for automata and formal languages over semirings, unifying algebraic and coalgebraic perspectives and extending classical automata concepts.

Findings

Formal languages as elements of dual coalgebras

Automata as pointed algebraic representations

Parallel automata execution via bialgebra constructions

Abstract

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 apply the defining diagrams of algebras, coalgebras, and bialgebras to categories of semimodules and semimodule homomorphisms over a commutative semiring. We then show that formal language theory and the theory of bialgebras have essentially undergone "convergent evolution", with the same constructions appearing in both contexts. For example, formal languages correspond to elements of dual algebras of coalgebras, automata are "pointed representation objects" of algebras, automaton morphisms are instances of linear intertwiners, and a construction from the theory of bialgebras shows how to run two automata in parallel. We also show how to associate an automaton with an arbitrary algebra, which in the classical case yields the automaton whose states are formal languages and whose transitions are given by language differentiation.