Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

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

englanti
2013-07-01
19,07 € 25,43 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 10-16 arkipäivässä

30 päivän palautusoikeus

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 ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

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.

Lisätietoja

Kirjoittaja Nasa Technical Reports Server (Ntrs), Alfons Geser, Et Al
Julkaisija Creative Media Partners, LLC
Julkaisuvuosi 2013
Kannen tyyppi Pehmeäkantinen
EAN 9781289263676
Kirjoita oma arvostelusi
Arvostelet: Match-Bounded String Rewriting Systems
Arvostelusi:

Goodreads-arvostelut

19,07 € 25,43 €