EuDML | Browse

String rewriting reductions of the form $t \to_{R}^{+} u t v$ , called loops, are the most frequent cause of infinite reductions (non- termination). Regarded as a model of computation, infinite reductions are unwanted whence their static detection is important. There are string rewriting systems which admit infinite reductions although they admit no loops. Their non-termination is particularly difficult to uncover. We present a few necessary conditions for the existence of loops, and thus establish a means...

Non-modular congruence lattices of Rees matrix semigroups

Katherine Johnston (1985)

Czechoslovak Mathematical Journal

Nonsingular semilattices and semigroups

C. S., Jr. Johnson, Frederick R. McMorris (1976)

Czechoslovak Mathematical Journal

Normal cryptogroups with an associate subgroup

Mario Petrich (2013)

Czechoslovak Mathematical Journal

Let $S$ be a semigroup. For $a, x \in S$ such that $a = a x a$ , we say that $x$ is an associate of $a$ . A subgroup $G$ of $S$ which contains exactly one associate of each element of $S$ is called an associate subgroup of $S$ . It induces a unary operation in an obvious way, and we speak of a unary semigroup satisfying three simple axioms. A normal cryptogroup $S$ is a completely regular semigroup whose $ℋ$ -relation is a congruence and $S / ℋ$ is a normal band. Using the representation of $S$ as a strong semilattice of Rees matrix semigroups,...

Currently displaying 401 – 420 of 991

Previous Page 21 Next

Displaying 401 – 420 of 991

Nil-orders of commutative nil-bounded semigroups.

Nilpotency in semigroups and sublattices of their Booleans

Nilsemigroups on trees.

No semigroup is a finite union of mutants.

Noble inverse semigroups with bisimple core.

Non-isomorphic semigroups with isomorphic semigroups of subsets.

Non-looping string rewriting

Non-Looping String Rewriting

Non-modular congruence lattices of Rees matrix semigroups

Nonsingular semilattices and semigroups

Normal cryptogroups with an associate subgroup

Not all fundamental 0-bisimple inverse semigroups contain charts.

Note of the greatest'semilattice decomposition of a semigroup.

Note on a certain class of orthodox semigroups.

Note on exclusive semigroups.

Note on nilpotency in semigroups

Note on quasi-Hamiltonian semigroups

Note on quasi-inverse semigroups.

Note on self-injective non-singular semigroups.

Note on semilattice congruences.

Currently displaying 401 – 420 of 991