EuDML | Browse

Page 1

Displaying 1 – 5 of 5

The algebraic structure of pseudomeadow

Hamid Kulosman (2024)

Commentationes Mathematicae Universitatis Carolinae

The purpose of this paper is to study the commutative pseudomeadows, the structure which is defined in the same way as commutative meadows, except that the existence of a multiplicative identity is not required. We extend the characterization of finite commutative meadows, given by I. Bethke, P. Rodenburg, and A. Sevenster in their paper (2015), to the case of commutative pseudomeadows with finitely many idempotents. We also extend the well-known characterization of general commutative meadows as...

The computability potential scale of all finite algebras.

Pinus, A.G. (2007)

Sibirskij Matematicheskij Zhurnal

The lattice of subautomata of an automaton: A survey.

Ćirić, M., Bogdanović, S., Petković, T. (1998)

Publications de l'Institut Mathématique. Nouvelle Série

The theory of core algebras: its completeness.

Freyd, Peter (2007)

Theory and Applications of Categories [electronic only]

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....