Pages that link to "Item:Q1402910"
From MaRDI portal
The following pages link to A polynomial time algorithm to compute the Abelian kernel of a finite monoid (Q1402910):
Displaying 5 items.
- On the complexity of computing the profinite closure of a rational language (Q719326) (← links)
- Abelian pointlikes of a monoid (Q1386717) (← links)
- Abelian kernels of monoids of order-preserving maps and of some of its extensions. (Q1882651) (← links)
- Computing relative Abelian kernels of finite monoids. (Q2509275) (← links)
- (Q4016522) (← links)
