Loops Of Superexponential Lengths In One Rule String Rewriting
Download and Read Loops Of Superexponential Lengths In One Rule String Rewriting full books in PDF, ePUB, and Kindle. Read online free Loops Of Superexponential Lengths In One Rule String Rewriting ebook anywhere anytime directly on your device. We cannot guarantee that every ebooks is available!
Loops of Superexponential Lengths in One-rule String Rewriting
Author | : Alfons Geser |
Publisher | : |
Total Pages | : 18 |
Release | : 2002 |
Genre | : |
ISBN | : |
Download Loops of Superexponential Lengths in One-rule String Rewriting Book in PDF, Epub and Kindle
Loops are the most frequent cause of non-termination in string rewriting. In the general case, non-terminating, non-looping string rewriting systems exist, and the uniform termination problem is undecidable. For rewriting with only one string rewriting rule, it is unknown whether non-terminating, non-looping systems exist and whether uniform termination is decidable. If in the one-rule case, non-termination is equivalent to the existence of loops, as McNaughton conjectures, then a decision procedure for the existence of loops also solves the uniform termination problem. As the existence of loops of bounded lengths is decidable, the question is raised how long shortest loops may be. We show that string rewriting rules exist whose shortest loops have superexponential lengths in the size of the rule.
Loops of Superexponential Lengths in One-rule String Rewriting Related Books
Pages: 18
Pages: 397
Pages: 527
Pages: 416
Pages: 64