𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Undecidable Properties on Length-Two String Rewriting Systems

✍ Scribed by Masahiko Sakai; Yi Wang

Book ID
108126929
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
353 KB
Volume
204
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Some properties of finite special string
Some properties of finite special string-rewriting systems
✍ Louxin Zhang πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 567 KB

This paper investigates decision problems of finite, special string-rewriting systems . There are two main results . The first one is that the word problem for a finite, special string-rewriting system T on alphabet A is reducible to its restricted version: given a word w, is w congruent to any fixe

It is undecidable whether a finite speci
It is undecidable whether a finite special string-rewriting system presents a group
✍ Paliath Narendran; Colm Γ“'DΓΊnlaing; Friedrich Otto πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 398 KB

It is shown that it is undecidable in general whether or not a monoid that is presented by a finite special string-rewriting system is a group. The given proof uses the technique of canonical string-rewriting systems.

On termination of confluent one-rule str
On termination of confluent one-rule string-rewriting systems
✍ Kayoko Shikishima-Tsuji; Masashi Katsura; Yuji Kobayashi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 507 KB

The termination of a confluent one-rule string-rewriting system R = (s + I} is reduced to that of another one-rule system K = {s' -B t') such that s' is self-overlap-free &of). A necessary and sufficient condition is given for termination of a one-rule system R = {s --+ t} such that s is sof and s o