Large simple binary equality words
From MaRDI portal
Publication:4923286
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- A Purely Homomorphic Characterization of Recursively Enumerable Sets
- A variant of a recursively unsolvable problem
- Decision problems for semi-Thue systems with a few rules
- Reduction tree of the binary generalized post correspondence problem
- The (generalized) Post correspondence problem with lists consisting of two words is decidable
Cited in
(6)
This page was built for publication: Large simple binary equality words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923286)