20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Match-Bounded String Rewriting Systems - Nasa Technical Reports Server (Ntrs),Alfons Geser,Et Al

English
2013-07-01
€20.40 €25.50

-20% with code BOOKS

In stock at our supplier

Shipping in 10-16 days

30-day return policy

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, m ... Full description

You May Also Like

Description

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.

More Information

Author Nasa Technical Reports Server (Ntrs), Alfons Geser, Et Al
Publisher Creative Media Partners, LLC
Release year 2013
Cover type Softcover
EAN 9781289263676
Write Your Own Review
You're reviewing: Match-Bounded String Rewriting Systems
Your Rating:

Goodreads Reviews

€20.40 €25.50