Automata, Languages, Decidability in Algebra

Ruskuc, Nik (PI)
Quick, Martyn (CoI)

Project: Standard

Acronym	Automata Languages Decidability
Status	Finished
Effective start/end date	1/03/10 → 31/05/14

Funding

EPSRC: £348,645.58

23 Article

Determining solubility for finitely generated groups of PL homeomorphisms
Bleak, C., Brough, T. & Hermiller, S., 19 Jul 2021, In: Transactions of the American Mathematical Society. 374, 10, p. 6815-6837 23 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
Automorphism groups of linearly ordered structures and endomorphisms of the ordered set (Q,≤) of rational numbers
McPhee, J. D., Mitchell, J. D. & Quick, M., Mar 2019, In: Quarterly Journal of Mathematics. 70, 1, p. 171-194 24 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
On regularity and the word problem for free idempotent generated semigroups
Dolinka, I., Gray, R. D. & Ruskuc, N., 3 Mar 2017, In: Proceedings of the London Mathematical Society. 114, 3, p. 401-432 32 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File