Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

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

inglise keel
2013-07-01
15,30 € 25,50 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 10-16 tööpäeva jooksul

30-päevane tagastamisõigus

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äielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Nasa Technical Reports Server (Ntrs), Alfons Geser, Et Al
Kirjastaja Creative Media Partners, LLC
Väljalaskeaasta 2013
Kaanetüüp Pehme kaanega
EAN 9781289263676
Kirjuta oma arvustus
Te vaatate: Match-Bounded String Rewriting Systems
Teie hinnang:

Goodreads'i arvustused

15,30 € 25,50 €