Large Simple Binary Equality Words
From MaRDI portal
Recommendations
Cites work
- A Purely Homomorphic Characterization of Recursively Enumerable Sets
- A variant of a recursively unsolvable problem
- Binary equality sets are generated by two words
- Defect effect of Bi-infinite words in the two-element case
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 4028926 (Why is no real title available?)
- scientific article; zbMATH DE number 3710436 (Why is no real title available?)
- scientific article; zbMATH DE number 3633742 (Why is no real title available?)
- scientific article; zbMATH DE number 1948502 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- On binary equality sets and a solution to the test set conjecture in the binary case
- 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 Q3533027)