For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Leicester

Return to search Previous output Next output
Output 0 of 0 in the submission
Article title

Groups and semigroups with a one-counter word problem

Type
D - Journal article
Title of journal
Journal of the Australian Mathematical Society
Article number
-
Volume number
85
Issue number
-
First page of article
197
ISSN of journal
1446-7887
Year of publication
2008
Number of additional authors
2
Additional information

<10>The connection between word problems of groups and formal language theory is well established and several deep results have been obtained (including the Muller-Schupp classification of context-free groups) but little is known when we generalize the situation to semigroups. This paper describes one-counter semigroups and answers a long standing question as to whether one can prove a result of Herbst from 1991 without using the Muller-Schupp classification. The paper also sets the scene for subsequent work such as that by Hoffmann et al in their 2012 DLT paper and by Brough in her paper arXiv:1104.1806.

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-