SOLVABILITY OF WORD EQUATIONS MODULE FINITE SPECIAL AND CONFLUENT STRING-REWRITING SYSTEMS IS UNDECIDABLE IN GENERAL

Authors
OTTO F
Citation
F. Otto, SOLVABILITY OF WORD EQUATIONS MODULE FINITE SPECIAL AND CONFLUENT STRING-REWRITING SYSTEMS IS UNDECIDABLE IN GENERAL, Information processing letters, 53(5), 1995, pp. 237-242
Citations number
15
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
53
Issue
5
Year of publication
1995
Pages
237 - 242
Database
ISI
SICI code
0020-0190(1995)53:5<237:SOWEMF>2.0.ZU;2-Y
Abstract
A finite, special, and confluent string-rewriting system S is construc ted such that it is undecidable in general whether a word equation is solvable module S. Thus, (word) unification module S is undecidable.