Large simple binary equality words
From MaRDI portal
Publication:4923286
DOI10.1142/S0129054112500207zbMATH Open1266.68149OpenAlexW1984024342MaRDI QIDQ4923286FDOQ4923286
Authors: Jana Hadravová, Štěpán Holub
Publication date: 6 June 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054112500207
Recommendations
Cites Work
- 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
- Title not available (Why is that?)
- 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)