๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Decision problems in classes of group presentations with uniformly solvable word problem

โœ Scribed by Jody Lockhart

Book ID
112501354
Publisher
Springer
Year
1981
Tongue
English
Weight
367 KB
Volume
37
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Some Non-Recursive Classes of Thue Syste
Some Non-Recursive Classes of Thue Systems With Solvable Word Problem
โœ Ann Yasuhara ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 863 KB

We take as our general setting decision problems regarding certain combinatorial properties of THUE systems and algebraic properties of the semi-groups they present. Let the class of all THUE systems be divided up as follows: V o = {all THUE systems with unsolvable word problem}, Wl = {all THUE sys

On complexity of the word problem in bra
On complexity of the word problem in braid groups and mapping class groups
โœ Hessam Hamidi-Tehrani ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 350 KB

We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w| 2 g) for |w| log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in the case of the closed surface is O(|w| 2 g 2 ). We also carry