It is known that a group presentation P can be regarded as a 2-complex with a single 0-cell. Thus we can consider a 3-complex with a single 0-cell which is known as a 3-presentation. Similarly, we can also consider 3-presentations for monoids. In this paper, by using spher- ical monoid pictures, we show that there exists a finite 3-monoid-presentation which has unsolvable ‘‘generalized identity problem’’ that can be thought as the next step (or one- dimension higher) of the word problem for monoids. We note that the method used in this paper has chemical and physical applications
There is a strong connection between monoids, automata and languages. The traditional approach is to...
There is a strong connection between monoids, automata and languages. The traditional approach is to...
There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim o...
It is known that a group presentation P can be regarded as a 2-complex with a single 0-cell. Thus we...
It is known that a group presentation P can be regarded as a 2-complex with a single 0-cell. Thus we...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
AbstractSquier (1987) showed that there exist finitely presented monoids with solvable word problem ...
AbstractWe study inverse monoids presented by a finite set of generators and one relation e = 1, whe...
AbstractThis paper investigates the word problem for inverse monoids generated by a set Γ subject to...
For every one-relator monoid M=⟨A∣u=v⟩ with u,v∈A∗ we construct a contractible M-CW complex and use ...
AbstractWe develop a combinatorial approach to the study of semigroups and monoids with finite prese...
AbstractIt is known that the word problem for one-relator groups and for one-relator monoids of the ...
There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim o...
AbstractThe complexity of the conjugacy problem CPM for monoids given by presentations of the form (...
There is a strong connection between monoids, automata and languages. The traditional approach is to...
There is a strong connection between monoids, automata and languages. The traditional approach is to...
There is a strong connection between monoids, automata and languages. The traditional approach is to...
There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim o...
It is known that a group presentation P can be regarded as a 2-complex with a single 0-cell. Thus we...
It is known that a group presentation P can be regarded as a 2-complex with a single 0-cell. Thus we...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
AbstractSquier (1987) showed that there exist finitely presented monoids with solvable word problem ...
AbstractWe study inverse monoids presented by a finite set of generators and one relation e = 1, whe...
AbstractThis paper investigates the word problem for inverse monoids generated by a set Γ subject to...
For every one-relator monoid M=⟨A∣u=v⟩ with u,v∈A∗ we construct a contractible M-CW complex and use ...
AbstractWe develop a combinatorial approach to the study of semigroups and monoids with finite prese...
AbstractIt is known that the word problem for one-relator groups and for one-relator monoids of the ...
There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim o...
AbstractThe complexity of the conjugacy problem CPM for monoids given by presentations of the form (...
There is a strong connection between monoids, automata and languages. The traditional approach is to...
There is a strong connection between monoids, automata and languages. The traditional approach is to...
There is a strong connection between monoids, automata and languages. The traditional approach is to...
There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim o...