Inverse semigroups with rational word problem are finite. - Tara Brough (CoRR, 2013)

Automaton semigroup constructions. - Tara Brough; Alan J. Cain (CoRR, 2013)

Permutations of context-free and indexed languages. - Tara Brough; Laura Ciobanu; Murray Elder (CoRR, 2014)

Groups with poly-context-free word problem. - Tara Brough (Groups Complex. Cryptol., 2014)

Automaton semigroups: new construction results and examples of non-automaton semigroups. - Tara Brough; Alan J. Cain (CoRR, 2016)

Permutations of context-free, ET0L and indexed languages. - Tara Brough; Laura Ciobanu; Murray Elder; Georg Zetzsche (Discret. Math. Theor. Comput. Sci., 2016)

Automaton semigroups: New constructions results and examples of non-automaton semigroups. - Tara Brough; Alan J. Cain (Theor. Comput. Sci., 2017)

Word Problem Languages for Free Inverse Monoids. - Tara Brough (DCFS, 2018)

Context-Free Word Problem Semigroups. - Tara Brough; Alan J. Cain; Markus Pfeiffer (DLT, 2019)

Automaton semigroup free products revisited. - Tara Brough (CoRR, 2020)

Word problem languages for completely regular semigroups. - Tara Brough (CoRR, 2020)

A language hierarchy of binary relations. - Tara Brough; Alan J. Cain (Inf. Comput., 2020)