References
- Berstel, J., Perrin, D. (1985). Theory of Codes. Orlando, FL: Academic Press.
- Birget, J. C. (2004). The groups of Richard Thompson and complexity. Int. J. Algebra Comput. 14(5/6):569–626. Dec. Preprint: arxiv.org/abs/math/0204292
- Birget, J. C. (2006). Circuits, coNP-completeness, and the groups of Richard Thompson. Int. J. Algebra Comput. 16(01):35–90. Feb. Preprint: arxiv.org/abs/math/0310335
- Birget, J. C. (2019). “New embeddings between the Higman-Thompson groups”. Preprint: arxiv.org/abs/1902.09414 v1 (25 Feb. 2019) and v2 (10 Mar. 2019).
- Burillo, J., Cleary, S., Stein, M. I. (2001). Metrics and embeddings of generalizations of Thompson’s group F. Trans. Amer. Math. Soc. 353(04):1677–1689. DOI: 10.1090/S0002-9947-00-02650-7.
- Cannon, J. W., Floyd, W. J., Parry, W. R. (1996). Introductory notes on Richard Thompson’s groups. L’Enseignement Mathématique. 42:215–256.
- Higman, G. (1974). Finitely presented infinite simple groups. Notes on Pure Mathematics, Vol. 8. Canberra: The Australian National University.
- Matte Bon, N. (2018). “Rigidity properties of full groups of pseudogroups over the Cantor set”. Preprint: arxiv.org/pdf/1801.10133.pdf (10 Dec. 2018)
- McKenzie, R., Thompson, R. J. (1973). An elementary construction of unsolvable word problems in group theory. In Boone, W. W., Cannonito, F. B., Lyndon, R. C. eds. Word Problems, North-Holland: North-Holland Publishing, pp. 457–478.
- Pardo, E. (2011). The isomorphism problem for Higman-Thompson groups. J. Algebra 344(1):172–183. DOI: 10.1016/j.jalgebra.2011.07.026.
- Scott, E. A. (1984). A construction which can be used to produce finitely presented infinite simple groups. J. Algebra 90(2):294–322. DOI: 10.1016/0021-8693(84)90172-8.
- Thompson, R. J. Manuscript (1960s).
- Thompson, R. J. (1980). Embeddings into finitely generated simple groups which preserve the word problem. In: Adian, S., Boone, W., Higman, G. eds. Word Problems II, North-Holland: North-Holland Publishing, p. 401–441