Related papers: A Bialgebraic Approach to Automata and Formal Lang…
To a semisimple and cosemisimple Hopf algebra over an algebraically closed field, we associate a planar algebra defined by generators and relations and show that it is a connected, irreducible, spherical, non-degenerate planar algebra with…
An averaging operator on an associative algebra $A$ is an algebraic abstraction of the time average operator on the space of real-valued functions defined in time-space. In this paper, we consider relative averaging operators on a bimodule…
After introducing some motivations for this survey, we describe a formalism to parametrize a wide class of algebraic structures occurring naturally in various problems of topology, geometry and mathematical physics. This allows us to define…
We present a new angle on solving quantified linear integer arithmetic based on combining the automata-based approach, where numbers are understood as bitvectors, with ideas from (nowadays prevalent) algebraic approaches, which work…
The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…
We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…
We introduce an algebraic analogue of dynamical systems, based on term rewriting. We show that a recursive function applied to the output of an iterated rewriting system defines a formal class of models into which all the main architectures…
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…
We investigate subshifts with a general algebraic structure and cellular automata on them, with an emphasis on (order-theoretic) lattices. Our main results concern the characterization of Boolean algebraic subshifts, conditions for…
The category of all $k$-algebras with a bilinear form, whose objects are all pairs $(R,b)$ where $R$ is a $k$-algebra and $b\colon R\times R\to k$ is a bilinear mapping, is equivalent to the category of unital $k$-algebras $A$ for which the…
The Eilenberg correspondence relates varieties of regular languages to pseudovarieties of finite monoids. Various modifications of this correspondence have been found with more general classes of regular languages on one hand and classes of…
An introductory formal languages course exposes advanced undergraduate and early graduate students to automata theory, grammars, constructive proofs, computability, and decidability. Programming students find these topics to be challenging…
Compact representations of automata are important for efficiency. In this paper, we study methods to compute reduced automata, in which no two states accept the same language. We do this for finitary automata (FA), an abstract definition…
This article is an introduction to formal languages from the point of view of combinatorial group theory. Group theoretic applications are included and language classes are defined algebraically.
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
The paper presents a detailed description of duality for braided algebras, coalgebras, bialgebras, Hopf algebras and their modules and comodules in the infinite setting. Assuming that the dual objects exist, it is shown how a given braiding…
We consider an evolution algebra which corresponds to a bisexual population with a set of females partitioned into finitely many different types and the males having only one type. We study basic properties of the algebra. This algebra is…
The algebra of diffeomorphisms derived from general coordinate transformations on commuting coordinates is represented by differential operators on noncommutative spaces. The algebra remains unchanged, the comultiplication however is…
The algebraic structure, linear algebra happens to be one of the subjects which yields itself to applications to several fields like coding or communication theory, Markov chains, representation of groups and graphs, Leontief economic…
Faithful representations of regular $\ast$-rings and modular complemented lattices with involution within orthosymmetric sesquilinear spaces are studied within the framework of Universal Algebra. In particular, the correspondence between…