Pages that link to "Item:Q1605327"
From MaRDI portal
The following pages link to The commutation of finite sets: A challenging problem (Q1605327):
Displaying 11 items.
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- Conjugacy of finite biprefix codes (Q1019714) (← links)
- A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) (Q1887138) (← links)
- Playing with Conway's problem (Q2378537) (← links)
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) (Q2437851) (← links)
- Commutation with codes (Q2484442) (← links)
- Regular solutions of language inequalities and well quasi-orders (Q2581271) (← links)
- On Conjugacy of Languages (Q3147021) (← links)
- On the simplest centralizer of a language (Q3431440) (← links)
- ORDERED AND $\mathcal{J}$-TRIVIAL SEMIGROUPS AS DIVISORS OF SEMIGROUPS OF LANGUAGES (Q3606407) (← links)
- A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES (Q4680586) (← links)
