Shrinking restarting automata
| dc.date.accessioned | 2006-04-05T12:48:59Z | |
| dc.date.available | 2006-04-05T12:48:59Z | |
| dc.date.issued | 2005 | |
| dc.identifier.uri | urn:nbn:de:hebis:34-200604059045 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/200604059045 | |
| dc.format.extent | 304431 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | |
| dc.publisher | Universität Kassel, FB 17, Mathematik/Informatik | eng |
| dc.rights | Urheberrechtlich geschützt | |
| dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | |
| dc.subject | Theoretische Informatik | eng |
| dc.subject | Reduktionssystem | eng |
| dc.subject.ddc | 004 | |
| dc.title | Shrinking restarting automata | eng |
| dc.type | Preprint | |
| dcterms.abstract | Restarting automata are a restricted model of computation that was introduced by Jancar et.al. to model the so-called analysis by reduction. A computation of a restarting automaton consists of a sequence of cycles such that in each cycle the automaton performs exactly one rewrite step, which replaces a small part of the tape content by another, even shorter word. Thus, each language accepted by a restarting automaton belongs to the complexity class $CSL cap NP$. Here we consider a natural generalization of this model, called shrinking restarting automaton, where we do no longer insist on the requirement that each rewrite step decreases the length of the tape content. Instead we require that there exists a weight function such that each rewrite step decreases the weight of the tape content with respect to that function. The language accepted by such an automaton still belongs to the complexity class $CSL cap NP$. While it is still unknown whether the two most general types of one-way restarting automata, the RWW-automaton and the RRWW-automaton, differ in their expressive power, we will see that the classes of languages accepted by the shrinking RWW-automaton and the shrinking RRWW-automaton coincide. As a consequence of our proof, it turns out that there exists a reduction by morphisms from the language class $cL(RRWW)$ to the class $cL(RWW)$. Further, we will see that the shrinking restarting automaton is a rather robust model of computation. Finally, we will relate shrinking RRWW-automata to finite-change automata. This will lead to some new insights into the relationships between the classes of languages characterized by (shrinking) restarting automata and some well-known time and space complexity classes. | eng |
| dcterms.accessRights | open access | |
| dcterms.creator | Jurdzinski, Tomasz | |
| dcterms.creator | Otto, Friedrich | |
| dcterms.isPartOf | Mathematische Schriften Kassel | eng |
| dcterms.isPartOf | 05, 01 | eng |
| dcterms.source.journal | Mathematische Schriften Kassel | |
| dcterms.source.volume | 05, 01 |
