✦ LIBER ✦

On the syntactic algorithm for the word problem of left distributivity

✍ Scribed by P. Dehornoy

Publisher: Springer
Year: 1997
Tongue: English
Weight: 341 KB
Volume: 37
Category: Article
ISSN: 0002-5240
DOI: 10.1007/s000120050013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dehn's algorithm for the word problem

✍ Martin Greendlinger 📂 Article 📅 1960 🏛 John Wiley and Sons 🌐 English ⚖ 778 KB

On the decidability of the word problem

On the decidability of the word problem for

✍ M. Mazzucchelli; A. Cherubini 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 506 KB

Distributed algorithms for the quickest

Distributed algorithms for the quickest path problem

✍ Yung-Chen Hung; Gen-Huey Chen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 955 KB

A New Algorithm for Solving the Word Pro

A New Algorithm for Solving the Word Problem in Braid Groups

✍ D. Garber; S. Kaplan; M. Teicher 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 148 KB

One of the most interesting questions about a group is whether its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists, and geometers, and is the target of intensive current research. We look at the braid group from a topologi

The complexity of Dehn's algorithm for w

The complexity of Dehn's algorithm for word problems in groups

✍ B Domanski; M Anshel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 361 KB

On the problem of syntactic analysis of

On the problem of syntactic analysis of languages. II

✍ V. N. Red'ko 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 559 KB