1. Aalbersberg, I.J., Hoogeboom, H.J.: Characterizations of the decidability of some problems for regular trace languages. Math. Syst. Theory 22, 1–19 (1989)
2. Agol, I.: The virtual Haken conjecture. With an appendix by Agol, Daniel Groves, and Jason Manning. Doc. Math. 18, 1045–1087 (2013)
3. Arora, S., Barak, B.: Computational complexity — a modern approach. Cambridge University Press, Cambridge (2009)
4. Babai, L., Beals, R., Cai, J., Ivanyos, G., Luks, E.M.: Multiplicative equations over commuting matrices. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1996, pp 498–507. ACM/SIAM (1996)
5. Bertoni, A., Mauri, G., Sabadini, N.: Membership problems for regular and context free trace languages. Inf. Comput. 82, 135–150 (1989)