Research output per year
Research output per year
Personal profile
Research interests
My main interest, and the subject of my current FCT grant project, is automata and languages in algebra, particularly in group and semigroup theory. I study languages arising in algebra, such as word problems, cross-sections (normal forms) and multiplication tables. I also do research on automaton semigroups, primarily from a semigroup constructions perspective.
Other interests: geometric and combinatorial group theory; modular Lie algebras; computational algebra.
Education/Academic qualification
Mathematics, Doctorate, Groups with poly-context-free word problem, University of Warwick
Award Date: 18 Apr 2011
Fingerprint
Dive into the research topics where Tara Brough is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Network
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Determining solubility for finitely generated groups of pl homeomorphisms
Bleak, C., Brough, T. & Hermiller, S., Oct 2021, In: Transactions of the American Mathematical Society. 374, 10, p. 6815-6837 23 p.Research output: Contribution to journal › Article › peer-review
-
A language hierarchy of binary relations
Brough, T. & Cain, A. J., Dec 2020, In: Information and Computation. 275, 104607.Research output: Contribution to journal › Article › peer-review
-
Two applications of monoid actions to cross-sections
Brough, T., Cain, A. J. & Maltcev, V., 3 May 2020, In: Communications in Algebra. 48, 5, p. 1894-1903 10 p.Research output: Contribution to journal › Article › peer-review
1 Citation (Scopus) -
Context-free word problem semigroups
Brough, T., Cain, A. J. & Pfeiffer, M., 2019, Developments in Language Theory - 23rd International Conference, DLT 2019, Proceedings. Hofman, P. & Skrzypczak, M. (eds.). Cham: Springer, p. 292-305 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11647 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Open AccessFile4 Citations (Scopus)13 Downloads (Pure) -
Word problem languages for free inverse monoids
Brough, T., 1 Jan 2018, Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings. Konstantinidis, S. & Pighizzini, G. (eds.). Cham: Springer Verlag, p. 24-36 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10952 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
4 Citations (Scopus)