scientific article; zbMATH DE number 3170321
From MaRDI portal
Publication:3289004
Cited in
(26)- Generalized symmetry of graphs - a survey
- L. M. Gluskin (1922--1985)
- Bands with isomorphic endomorphism semigroups
- Semigroups of endotopisms of the efficient connected relations
- Relatively elementary definability of the class of universal graphic semiautomata in the class of semigroups
- On relatively elementary definability of graph classes in the class of semigroups
- On concrete characterization of universal graphic automata
- Elementary definability of the class of universal planar automata in the class of semigroups
- Abstract characterization of input symbol semigroups of universal hypergraphic automata
- Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs
- Regularity in the semigroup of transformations preserving a zig-zag order
- Correspondences of the semigroup of endomorphisms of an equivalence relation.
- On regularity of semigroups of maps that preserve a binary relation
- scientific article; zbMATH DE number 672105 (Why is no real title available?)
- Orbits of primitive k-homogeneous groups on (n-k)-partitions with applications to semigroups
- On a concrete characterization problem of universal graphic semiautomata
- On definability of universal graphic automata by their input symbol semigroups
- scientific article; zbMATH DE number 7310257 (Why is no real title available?)
- scientific article; zbMATH DE number 7310269 (Why is no real title available?)
- Regularity of semigroups of transformations with restricted range preserving an alternating orientation order
- On the problem of abstract characterization of universal graphic automata
- Definability of relations by semigroups of isotone transformations
- Relatively elementary definability of the class of universal partial graphic semiautomata over nontrivial reflexive graphs in the class of semigroups
- Structures characterizing partially ordered sets, and their automorphism groups
- On concrete characterization problem of endomorphism semigroups of graphs
- A method of finding automorphism groups of endomorphism monoids of relational systems.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3289004)