One-rule semi-Thue systems with loops of length one, two or three

Winfried Kurth

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “One-rule semi-Thue systems with loops of length one, two or three”

Non-looping string rewriting

Alfons Geser, Hans Zantema (1999)

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

Similarity:

On the average minimal prefix-length of the generalized semi-Dycklanguage

Rainer Kemp (1996)

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

Similarity:

Identities and the group of isostrophisms

Aleš Drápal, Viktor Alekseevich Shcherbakov (2012)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In this paper we reexamine the concept of isostrophy. We connect it to the notion of term equivalence, and describe the action of dihedral groups that are associated with loops by means of isostrophy. We also use it to prove and present in a new way some well known facts on $m$ -inverse loops and middle Bol loops.

Semi-commutations and partial commutations

M. Clerbout, Y. Roos, I. Ryl (2000)

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

Similarity:

Classification of Bol loops of order 18

B. L. Sharma (1984)

Acta Universitatis Carolinae. Mathematica et Physica

Similarity: