Pages that link to "Item:Q3720578"
From MaRDI portal
The following pages link to The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete (Q3720578):
Displaying 10 items.
- A hierarchy of monotone deterministic non-forgetting restarting automata (Q633765) (← links)
- On two problems related to cancellativity (Q1070349) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619) (← links)
- Parikh-reducing Church-Rosser representations for some classes of regular languages (Q1676318) (← links)
- On equations and first-order theory of one-relator monoids (Q2051781) (← links)
- Hierarchies of weakly monotone restarting automata (Q3025320) (← links)
- Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems (Q3708211) (← links)
- Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems (Q3741791) (← links)
- Left-to-right regular languages and two-way restarting automata (Q5321782) (← links)
