Displaying 21 – 40 of 59

Showing per page

Non-looping string rewriting

Alfons Geser, Hans Zantema (1999)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Non-Looping String Rewriting

Alfons Geser, Hans Zantema (2010)

RAIRO - Theoretical Informatics and Applications

String rewriting reductions of the form t 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...

Normal cryptogroups with an associate subgroup

Mario Petrich (2013)

Czechoslovak Mathematical Journal

Let S be a semigroup. For a , x 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 21 – 40 of 59