Results 1 to 10 of about 2,424 (82)
The omega-inequality problem for concatenation hierarchies of star-free languages [PDF]
The problem considered in this paper is whether an inequality of omega-terms is valid in a given level of a concatenation hierarchy of star-free languages.
Almeida, J., Klíma, O., Kunc, M.
core +2 more sources
Eilenberg Theorems for Free [PDF]
Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic language theory.
Adámek, Jiří +3 more
core +2 more sources
Identities in the Algebra of Partial Maps [PDF]
We consider the identities of a variety of semigroup-related algebras modelling the algebra of partial maps. We show that the identities are intimately related to a weak semigroup deductive system and we show that the equational theory is decidable.
Jackson, Marcel, Stokes, Tim E.
core +2 more sources
Schreier split extensions of preordered monoids [PDF]
Properties of preordered monoids are investigated and important subclasses of such structures are studied. The corresponding full subcategories of the category of preordered monoids are functorially related between them as well as with the categories of ...
Martins-Ferreira, Nelson +1 more
core +2 more sources
Monoids with tests and the algebra of possibly non-halting programs [PDF]
We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, if-then-else and while-do defined in ...
Jackson, Marcel, Stokes, Tim E.
core +4 more sources
The Finite Basis Problem for Kiselman Monoids [PDF]
In an earlier paper, the second-named author has described the identities holding in the so-called Catalan monoids. Here we extend this description to a certain family of Hecke--Kiselman monoids including the Kiselman monoids $\mathcal{K}_n$.
Ashikhmin, D. N. +2 more
core +2 more sources
Inverse monoids of partial graph automorphisms
A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the algebraic structure
Jajcay, Robert +3 more
core +1 more source
On Congruence Compact Monoids [PDF]
A universal algebra is called congruence compact if every family of congruence classes with the finite intersection property has a non-empty intersection.
Bulman-Fleming, Sydney
core +2 more sources
Extending the Ehresmann-Schein-Nambooripad Theorem
We extend the `join-premorphisms' part of the Ehresmann-Schein-Nambooripad Theorem to the case of two-sided restriction semigroups and inductive categories, following on from a result of Lawson (1991) for the `morphisms' part.
C. Hollings +17 more
core +1 more source
Tensor products and regularity properties of Cuntz semigroups
The Cuntz semigroup of a C*-algebra is an important invariant in the structure and classification theory of C*-algebras. It captures more information than K-theory but is often more delicate to handle.
Antoine, Ramon +2 more
core +1 more source

