3 papers
math.GR2020
Word problem languages for completely regular semigroups
Tara Brough
Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages (including context-free…
math.GR2019
Context-free word problem semigroups
Tara Brough, Alan J. Cain, Markus Pfeiffer
This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationshi…
cs.FL2016
Permutations of context-free, ET0L and indexed languages
Tara Brough, Laura Ciobanu, Murray Elder +1
For a language , we consider its cyclic closure, and more generally the language , which consists of all words obtained by partitioning words from into factors a…