Groups with poly-context-free word problem
We call a language poly-context-free if it is an intersection of finitely many contextfree languages. In this thesis, we consider the class of groups with poly-context-free word problem. This is a generalisation of the groups with context-free word problem, which have been shown by Muller and Schupp...
| Main Author: | |
|---|---|
| Published: |
University of Warwick
2010
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.536266 |