Pages that link to "Item:Q1164045"
From MaRDI portal
The following pages link to A note on Post's correspondence problem (Q1164045):
Displaying 10 items.
- When is a pair of matrices mortal? (Q290262) (← links)
- Successful visual human-computer interaction is undecidable (Q293299) (← links)
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- On some variants of Post's correspondence problem (Q792770) (← links)
- Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
- Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
- Flatwords and Post Correspondence Problem (Q1351939) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Word problem for deterministic and reversible semi-Thue systems (Q2247995) (← links)
- An undecidable problem for countable markov chains (Q4007371) (← links)
