Groups with poly-context-free word problem T Brough Groups Complexity Cryptology 6 (1), 9-29, 2014 | 22 | 2014 |
Automaton semigroup constructions T Brough, AJ Cain Semigroup Forum 90 (3), 763-774, 2015 | 16 | 2015 |
Automaton semigroups: new constructions results and examples of non-automaton semigroups T Brough, AJ Cain Theoretical Computer Science 674, 1-15, 2017 | 15 | 2017 |
Determining solubility for finitely generated groups of PL homeomorphisms C Bleak, T Brough, S Hermiller Transactions of the American Mathematical Society 374 (10), 6815-6837, 2021 | 5 | 2021 |
Context-free word problem semigroups T Brough, AJ Cain, M Pfeiffer International Conference on Developments in Language Theory, 292-305, 2019 | 5 | 2019 |
Word Problem Languages for Free Inverse Monoids T Brough International Conference on Descriptional Complexity of Formal Systems, 24-36, 2018 | 5 | 2018 |
Inverse semigroups with rational word problem are finite T Brough arXiv preprint arXiv:1311.3955, 2013 | 4 | 2013 |
A language hierarchy of binary relations T Brough, AJ Cain Information and Computation 275, 104607, 2020 | 2 | 2020 |
Two applications of monoid actions to cross-sections T Brough, AJ Cain, V Maltcev Communications in Algebra 48 (5), 1894-1903, 2020 | 1 | 2020 |
Automaton semigroup free products revisited T Brough arXiv preprint arXiv:2003.12810, 2020 | 1 | 2020 |
Permutations of context-free and indexed languages T Brough, L Ciobanu, M Elder arXiv preprint arXiv:1412.5512, 2014 | 1 | 2014 |
Finitely generated soluble groups and their subgroups T Brough, DF Holt Communications in Algebra 41 (5), 1790-1799, 2013 | 1 | 2013 |
Word problem languages for completely regular semigroups T Brough arXiv preprint arXiv:2003.13608, 2020 | | 2020 |
Permutations of context-free, ET0L and indexed languages G Zetzsche, M Elder, L Ciobanu, T Brough Discrete Mathematics & Theoretical Computer Science 17, 2016 | | 2016 |
Graded Lie algebras of Cartan type in characteristic 2 T Brough, B Eick arXiv preprint arXiv:1510.02289, 2015 | | 2015 |