Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

Currently displaying 1 – 2 of 2

Order by Relevance | Title | Year of publication

Non-looping string rewriting

Alfons Geser; Hans Zantema — 1999

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Non-Looping String Rewriting

Alfons Geser; Hans Zantema — 2010

RAIRO - Theoretical Informatics and Applications

String rewriting reductions of the form $t \to_{R}^{+} u t v$ , called , are the most frequent cause of infinite reductions (non- termination). Regarded as a model of computation, infinite reductions are unwanted whence their static detection is important. There are string rewriting systems which admit infinite reductions although they admit no loops. Their non-termination is particularly difficult to uncover. We present a few conditions for the existence of loops, and thus establish a means to recognize ...

Page 1

Download Results (CSV)