Pages that link to "Item:Q1853553"
From MaRDI portal
The following pages link to Conway's problem for three-word sets. (Q1853553):
Displaying 12 items.
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- Decision problems for language equations (Q972384) (← links)
- A first step in characterizing three-element codes (Q1656554) (← links)
- A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) (Q1887138) (← links)
- Playing with Conway's problem (Q2378537) (← links)
- On structure of domains with quadratic growth. (Q2386068) (← 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 the simplest centralizer of a language (Q3431440) (← links)
- The second step in characterizing a three-word code (Q6090990) (← links)
