𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof of termination of the rewriting system subst on CCL

✍ Scribed by Thérèse Hardin; Alain Laville

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
407 KB
Volume
46
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A result on braids via the investigation
A result on braids via the investigation of a rewriting system
✍ Serge Burckel 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 87 KB

The study of a rewriting system gives a very simple characterization of a canonical form of positive braids on three strands which had previously been defined with a well-ordering structure.

Optimization problems on the performance
Optimization problems on the performance of a nonreliable terminal system
✍ B. Almási; J. Sztrik 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 514 KB

The aim of this paper is to investigate the effect of the different service disciplines, such as FIFO, PS, Priority Processor Sharing, Polling, on the main performance measures, such as utilizations, response times, throughput, mean queue length. It has been shown by numerical examples that even in