✦ LIBER ✦

Match-Bounded String Rewriting Systems

✍ Scribed by Alfons Geser; Dieter Hofbauer; Johannes Waldmann

Book ID: 105867418
Publisher: Springer
Year: 2004
Tongue: English
Weight: 228 KB
Volume: 15
Category: Article
ISSN: 0938-1279
DOI: 10.1007/s00200-004-0162-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The derivational complexity of string re

The derivational complexity of string rewriting systems

✍ Yuji Kobayashi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Codes modulo finite monadic string-rewri

Codes modulo finite monadic string-rewriting systems

✍ Friedrich Otto; Paliath Narendran 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 923 KB

Infinite String Rewrite Systems and Comp

Infinite String Rewrite Systems and Complexity

✍ Jean-Camille Birget 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 712 KB

We study the relation between time complexity and derivation work for the word problem of infinitely presented semigroups and groups. We introduce the notion of the work of a derivation (defined as the sum of the lengths of all the rules used in the derivation, with multiplicity). The following resu

Undecidable Properties on Length-Two Str

Undecidable Properties on Length-Two String Rewriting Systems

✍ Masahiko Sakai; Yi Wang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 353 KB

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

Non-Looping String Rewriting

✍ Geser, Alfons; Zantema, Hans 📂 Article 📅 1999 🏛 EDP Sciences 🌐 English ⚖ 24 KB