Match-Bounded String Rewriting Systems - Softcover

Geser, Alfons

Softcover

ISBN 10: 1289263671 ISBN 13: 9781289263676

Publisher: Bibliogov, 2013

Synopsis

We introduce a new class of automated proof methods for the termination of rewriting systems on strings. The basis of all these methods is to show that rewriting preserves regular languages. To this end, letters are annotated with natural numbers, called match heights. If the minimal height of all positions in a redex is h+1 then every position in the reduct will get height h+1. In a match-bounded system, match heights are globally bounded. Using recent results on deleting systems, we prove that rewriting by a match-bounded system preserves regular languages. Hence it is decidable whether a given rewriting system has a given match bound. We also provide a sufficient criterion for the abence of a match-bound. The problem of existence of a match-bound is still open. Match-boundedness for all strings can be used as an automated criterion for termination, for match-bounded systems are terminating. This criterion can be strengthened by requiring match-boundedness only for a restricted set of strings, for instance the set of right hand sides of forward closures.

Edition details

• Publisher: Bibliogov
• Publication date: 2013
• Language: English
• ISBN 10: 1289263671
• ISBN 13: 9781289263676
• Binding: Paperback
• Number of pages: 26