AbstractThe groups Gk,1 of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call Mk,1, and to inverse monoids, called Invk,1; this is done by simply generalizing bijections to partial functions or partial injective functions. The monoids Mk,1 have connections with circuit complexity (studied in other papers). Here we prove that Mk,1 and Invk,1 are congruence-simple for all k. Their Green relations J and D are characterized: Mk,1 and Invk,1 are J-0-simple, and they have k−1 non-zero D-classes. They are submonoids of the multiplicative part of the Cuntz algebra Ok. They are finitely generated, and their word problem over any finite generating set is in P. Their word problem is coNP-complete over certa...
Wir haben eine Konstruktion inverser Monoide $FIM(\Gamma)/P$ und $IM(G)/P$, beruhend auf Arbeiten vo...
This paper defines the Lebesgue measure preserving Thompson monoid, denoted by G, which is modeled o...
We study the problem of learning an unknown function represented as an expression or a program over ...
We generalise the group theoretic notion of a primitive permutation representation to inverse monoid...
AbstractThe theory of generators and relations for groups is closely related to the geometry of cert...
In 1979, Norton showed that the representation theory of the 0-Hecke algebra admits a rich ...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
This thesis presents several complete and partial models for the homotopy theory of monoids and the ...
There is a strong connection between monoids, automata and languages. The traditional approach is to...
AbstractThe concept of a ∗-variety of congruences is introduced and related to ∗-variety of language...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
AbstractThe complexity of the conjugacy problem CPM for monoids given by presentations of the form (...
We study the variety W generated by monoids of upper-triangular boolean matrices. First, we present ...
AbstractThis paper investigates the word problem for inverse monoids generated by a set Γ subject to...
We exhibit explicit and easily realisable bijections between Hecke--Kiselman monoids of type $A_n$/...
Wir haben eine Konstruktion inverser Monoide $FIM(\Gamma)/P$ und $IM(G)/P$, beruhend auf Arbeiten vo...
This paper defines the Lebesgue measure preserving Thompson monoid, denoted by G, which is modeled o...
We study the problem of learning an unknown function represented as an expression or a program over ...
We generalise the group theoretic notion of a primitive permutation representation to inverse monoid...
AbstractThe theory of generators and relations for groups is closely related to the geometry of cert...
In 1979, Norton showed that the representation theory of the 0-Hecke algebra admits a rich ...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
This thesis presents several complete and partial models for the homotopy theory of monoids and the ...
There is a strong connection between monoids, automata and languages. The traditional approach is to...
AbstractThe concept of a ∗-variety of congruences is introduced and related to ∗-variety of language...
Chapter 1 defines basic ideas such as definition of monoids, homomorphisms of monoids, congruences, ...
AbstractThe complexity of the conjugacy problem CPM for monoids given by presentations of the form (...
We study the variety W generated by monoids of upper-triangular boolean matrices. First, we present ...
AbstractThis paper investigates the word problem for inverse monoids generated by a set Γ subject to...
We exhibit explicit and easily realisable bijections between Hecke--Kiselman monoids of type $A_n$/...
Wir haben eine Konstruktion inverser Monoide $FIM(\Gamma)/P$ und $IM(G)/P$, beruhend auf Arbeiten vo...
This paper defines the Lebesgue measure preserving Thompson monoid, denoted by G, which is modeled o...
We study the problem of learning an unknown function represented as an expression or a program over ...