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

DOI10.1142/S0218196712500610zbMath1284.68320arXiv1201.6616OpenAlexW3099396151MaRDI QIDQ4902680

Alan J. Cain, Victor Maltcev

Publication date: 17 January 2013

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.6616

zbMATH Keywords

uniquenessstring rewriting systemcontext-freeword-hyperbolic monoid

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42)

Related Items

Decision problems for word-hyperbolic semigroups, Markov semigroups, monoids and groups, On the word problem for special monoids, MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS, A language hierarchy of binary relations, GROWTHS OF ENDOMORPHISMS OF FINITELY GENERATED SEMIGROUPS, Finitely presented monoids with linear Dehn function need not have regular cross-sections., A strong geometric hyperbolicity property for directed graphs and monoids.

Cites Work

• Unnamed Item
• On the definition of word hyperbolic groups.
• Automatic semigroups
• HYPERBOLIC GROUPS AND COMPLETELY SIMPLE SEMIGROUPS
• INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
• Word hyperbolic semigroups