Ordering D-classes and computing Schein rank is hard.
G. Markowsky (1992)
Semigroup forum
Similarity:
Displaying similar documents to “Ranks of binary relations.”
Ordering D-classes and computing Schein rank is hard.
Finite binary relations have no more complexity than finite semigroups.
John Rhodes (1974)
Semigroup forum
Similarity:
Homomorphisms of semigroups of binary relations.
D.B. McAlister (1971)
Semigroup forum
Similarity:
Corrigenda to "New semigroups of binary relations" "by Karen Chase.
K. Chase (1979)
Semigroup forum
Similarity:
New semigroups of binary relations.
K. Chase (1979)
Semigroup forum
Similarity:
On Schützenberger monoids in transformation semigroups.
I. Kossaczky (1989)
Semigroup forum
Similarity:
Green's equivalences in finite semigroups of binary relations.
J. Konieczny (1994)
Semigroup forum
Similarity:
Partial orders and their semigroups of closed relations.
D.W. Hardy, M.C. Thornton (1982)
Semigroup forum
Similarity:
On certain codes admitting inverse semigroups as syntactic monoids.
G. Lallement, M. Keenan (1974)
Semigroup forum
Similarity:
On certain two generator monoids.
R.P. Hunter (1993)
Semigroup forum
Similarity:
Goldie's theorem for semigroups.
G. Song (1993)
Semigroup forum
Similarity: