𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Codes modulo finite monadic string-rewriting systems

✍ Scribed by Friedrich Otto; Paliath Narendran

Book ID
107948842
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
923 KB
Volume
134
Category
Article
ISSN
0304-3975

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

Infinite Convergent String-rewriting Sys
Infinite Convergent String-rewriting Systems and Cross-sections for Finitely Presented Monoids
✍ F. OTTO; M. KATSURA; Y. KOBAYASHI πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 635 KB

A finitely presented monoid has a decidable word problem if and only if it can be presented by some left-recursive convergent string-rewriting system if and only if it has a recursive cross-section. However, regular cross-sections or even context-free cross-sections do not suffice. This is shown by