Displaying 21 – 40 of 55

Showing per page

Presolid varieties of n-semigroups

Avapa Chantasartrassmee, Jörg Koppitz (2005)

Discussiones Mathematicae - General Algebra and Applications

he class of all M-solid varieties of a given type t forms a complete sublattice of the lattice ℒ(τ) of all varieties of algebrasof type t. This gives a tool for a better description of the lattice ℒ(τ) by characterization of complete sublattices. In particular, this was done for varieties of semigroups by L. Polák ([10]) as well as by Denecke and Koppitz ([4], [5]). Denecke and Hounnon characterized M-solid varieties of semirings ([3]) and M-solid varieties of groups were characterized by Koppitz...

Sturdy frames of type (2,2) algebras and their applications to semirings

X. Z. Zhao, Y. Q. Guo, K. P. Shum (2003)

Fundamenta Mathematicae

We introduce sturdy frames of type (2,2) algebras, which are a common generalization of sturdy semilattices of semigroups and of distributive lattices of rings in the theory of semirings. By using sturdy frames, we are able to characterize some semirings. In particular, some results on semirings recently obtained by Bandelt, Petrich and Ghosh can be extended and generalized.

The semantical hyperunification problem

Klaus Denecke, Jörg Koppitz, Shelly Wismath (2001)

Discussiones Mathematicae - General Algebra and Applications

A hypersubstitution of a fixed type τ maps n-ary operation symbols of the type to n-ary terms of the type. Such a mapping induces a unique mapping defined on the set of all terms of type t. The kernel of this induced mapping is called the kernel of the hypersubstitution, and it is a fully invariant congruence relation on the (absolutely free) term algebra F τ ( X ) of the considered type ([2]). If V is a variety of type τ, we consider the composition of the natural homomorphism with the mapping induced...

Tree transformations defined by hypersubstitutions

Sr. Arworn, Klaus Denecke (2001)

Discussiones Mathematicae - General Algebra and Applications

Tree transducers are systems which transform trees into trees just as automata transform strings into strings. They produce transformations, i.e. sets consisting of pairs of trees where the first components are trees belonging to a first language and the second components belong to a second language. In this paper we consider hypersubstitutions, i.e. mappings which map operation symbols of the first language into terms of the second one and tree transformations defined by such hypersubstitutions....

Currently displaying 21 – 40 of 55