Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka. The Satisfiability of Word Equations: Decidable and Undecidable Theories. In Igor Potapov, Pierre-Alain Reynier, editors, Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings. Volume 11123 of Lecture Notes in Computer Science, pages 15-29, Springer, 2018. [doi]
@inproceedings{DayGHMN18,
title = {The Satisfiability of Word Equations: Decidable and Undecidable Theories},
author = {Joel D. Day and Vijay Ganesh and Paul He and Florin Manea and Dirk Nowotka},
year = {2018},
doi = {10.1007/978-3-030-00250-3_2},
url = {https://doi.org/10.1007/978-3-030-00250-3_2},
researchr = {https://researchr.org/publication/DayGHMN18},
cites = {0},
citedby = {0},
pages = {15-29},
booktitle = {Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings},
editor = {Igor Potapov and Pierre-Alain Reynier},
volume = {11123},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-00250-3},
}