1
vote
1answer
46 views

Generalising cover maps from monoids to semigroups

Let $T,S$ be monoids. A partial surjective mapping $\psi : T \to S$ is called a cover map if for each $s \in S$ there exists some $\hat{s} \in T$ called a cover of $s$ such that for each $t \in ...
2
votes
1answer
56 views

(Transformation) Semigroups, the semigroup $\mathbf D_n$ and the wreath product

I have some trouble understanding the following proof, were I can't even figure out how some terms are defined. But first I state some definitions and preliminary lemmas. A transformation semigroup ...
0
votes
0answers
48 views

Proof involving handling of Greens Relations (Semigroup-Theory)

I am working through a proof which involves Green's relations. It goes like this (for $s,s', e', e$ holds $se = s, e^2 = e$ and $s'e' = s', e'^2 = e'$, they are called linked pairs) Conversely, ...
1
vote
2answers
156 views

Whether $L=\{(a^m,a^n)\}^*$ is regular or not?

I am condidering the automatic structure for Baumslag-Solitar semigroups. And I have a question. For any $m,n \in Z$, whether the set $L=\{(a^m,a^n)\}^*$ is regular or not. Here a set is regular means ...
2
votes
1answer
132 views

Two elementary question on automaton and language

1.What is the definition for a semigroup(or monoid) recognizing a set of words(or language)?2.Are recognizable,rational and regular equivalent to each other with respect to a language? PS:The reason ...
14
votes
1answer
408 views

Eilenberg's rational hierarchy of nonrational automata & languages

In the preface to his very influential books Automata, Languages and Machines (Volumes A, B), Samuel Eilenberg tantalizingly promised a Volume C dealing with "a hierarchy (called the rational ...