Pages that link to "Item:Q751298"
From MaRDI portal
The following pages link to An undecidable problem about rational sets and contour words of polyominoes (Q751298):
Displaying 6 items.
- Polyomino tilings, cellular automata and codicity (Q672463) (← links)
- Decision problems and regular chain code picture languages (Q686522) (← links)
- \(q\)-enumeration of convex polyominoes (Q1318368) (← links)
- A codicity undecidable problem in the plane. (Q1401375) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Undecidability of existential properties in picture languages (Q1575948) (← links)
