✦ LIBER ✦

On the decidability of the word problem for

✍ Scribed by M. Mazzucchelli; A. Cherubini

Publisher: Springer
Year: 2007
Tongue: English
Weight: 506 KB
Volume: 76
Category: Article
ISSN: 0037-1912
DOI: 10.1007/s00233-007-9030-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On decidability of the decomposability p

On decidability of the decomposability problem for finite theories

✍ Andrey S. Morozov; Denis K. Ponomaryov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 181 KB

Decidability of the word problem in Yama

Decidability of the word problem in Yamamura’s HNN extensions of finite inverse semigroups

✍ Emanuele Rodaro; Alessandra Cherubini 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 491 KB

Almost all one-rule thue systems have de

Almost all one-rule thue systems have decidable word problems

✍ Ronald V Book; Craig C Squier 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 167 KB

The decidability of the word problem for one-rule Thue systems is an open cluestion. In the case of one-rule special Thue systems, i.e., those of the form {(w, 1)} where 1 is the identity, it is known [1] that the word problem is decidable. Here we show that 'almost all' one-rule Thue systems have

A class of semigroups with a decidable w

A class of semigroups with a decidable word problem

✍ G. U. Oganesyan 📂 Article 📅 1978 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 290 KB

Decidability of the termination problem

Decidability of the termination problem for completely specified protocols

✍ Alain Finkel 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 854 KB

On the decidability of the equivalence p

On the decidability of the equivalence problem for partially commutative rational power series

✍ Stefano Varricchio 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 481 KB