Pages that link to "Item:Q1073015"
From MaRDI portal
The following pages link to Complexity results on the conjugacy problem for monoids (Q1073015):
Displaying 20 items.
- The Knuth-Bendix algorithm and the conjugacy problem in monoids. (Q633198) (← links)
- Conjugacy in monoids with a special Church-Rosser presentation is decidable (Q801163) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- On two problems related to cancellativity (Q1070349) (← links)
- On deciding whether a monoid is a free monoid or is a group (Q1075439) (← links)
- The problems of cyclic equality and conjugacy for finite complete rewriting systems (Q1089798) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619) (← links)
- Trace monoids with some invertible generators: Two decision problems (Q1179186) (← links)
- Decidability and independence of conjugacy problems in finitely presented monoids (Q1637219) (← links)
- Incidence monoids: automorphisms and complexity (Q1982577) (← links)
- On equations and first-order theory of one-relator monoids (Q2051781) (← links)
- Deciding conjugacy in sylvester monoids and other homogeneous monoids (Q2942806) (← links)
- (Q3363320) (← links)
- (Q4016522) (← links)
- THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS (Q4711250) (← links)
- (Q4941894) (← links)
- (Q5016373) (← links)
- STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET (Q5462123) (← links)
