CONTEXT-FREE REWRITING SYSTEMS AND WORD-HYPERBOLIC STRUCTURES WITH UNIQUENESS-Reference-Cited by-同舟云学术

CONTEXT-FREE REWRITING SYSTEMS AND WORD-HYPERBOLIC STRUCTURES WITH UNIQUENESS

Published:2012-11 Issue:07 Volume:22 Page:1250061
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

CAIN ALAN J.¹,MALTCEV VICTOR²

Affiliation:

1. Centro de Matemática, Universidade do Porto, Rua do Campo Alegre 687, 4169–007 Porto, Portugal

2. School of Mathematics & Statistics, University of St Andrews, North Haugh, St Andrews, Fife KY16 9SS, UK

Abstract

This paper proves that any monoid presented by a confluent context-free monadic rewriting system is word-hyperbolic. This result then applied to answer a question asked by Duncan and Gilman by exhibiting an example of a word-hyperbolic monoid that does not admit a word-hyperbolic structure with uniqueness (that is, in which the language of representatives maps bijectively onto the monoid).

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196712500610

Reference11 articles.

1. String-Rewriting Systems

2. Automatic semigroups

3. INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS

4. Word hyperbolic semigroups

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS;Journal of the Australian Mathematical Society;2023-03-17

2. On the word problem for special monoids;Semigroup Forum;2022-05-31

3. A language hierarchy of binary relations;Information and Computation;2020-12

4. Context-Free Word Problem Semigroups;Developments in Language Theory;2019

5. Decision problems for word-hyperbolic semigroups;Journal of Algebra;2016-11