Automaticity of one-relator semigroups with length less than or equal to three

Abstract: The main results of this paper is to give a complete characterization of the automaticity of one-relator semigroups with length less than or equal to three. Let

S = s g p l a n g l e A | u = v a n g l e

be a semigroup generated by a set

A = a_{1}, a_{2}, d o t s, a_{n}, n i n m a t h b b N

with defining relation

u = v

, where

u, v i n A^{*}

and

A^{*}

is the free monoid generated by

A

. Such a semigroup is called a one-relator semigroup. Suppose that

| v | l e q | u | l e q 3

, where

| u |

is the length of the word

u

. Suppose that

a, b i n A, a e q b

. Then we have the following: (1)

S

is prefix-automatic if

u = v o t i n a b a = b a, a a b = b a, a b b = b b

. Moreover, if

u = v i n a b a = b a, a a b = b a, a b b = b b

then

S

is not automatic. (2)

S

is biautomatic if one of the following holds: (i)

| u | = 3, | v | = 0

, (ii)

| u | = | v | = 3

, (iii)

| u | = 2

and

u = v o t i n a b = a, a b = b

. Moreover, if

u = v i n a b = a, a b = b

then

S

is not biautomatic.

Recommendations

Cites work

This page was built for publication: Automaticity of one-relator semigroups with length less than or equal to three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364902)