A Complete Characterization of Termination of 0p 1q→ 1r 0s
Identifieur interne : 002203 ( Istex/Checkpoint ); précédent : 002202; suivant : 002204A Complete Characterization of Termination of 0p 1q→ 1r 0s
Auteurs : Hans Zantema ; Alfons Geser [États-Unis]Source :
- Applicable Algebra in Engineering, Communication and Computing [ 0938-1279 ] ; 2000-08-01.
English descriptors
Abstract
Abstract.: We characterize termination of one-rule string rewriting systems of the form 0 p 1 q → 1 r 0 s for every choice of positive integers p, q, r, and s. In doing so we introduce a termination proof method that applies to some hard examples. For the simply terminating cases, i.e. string rewriting systems that can be ordered by a division order, we give the precise complexity of derivation lengths.
Url:
DOI: 10.1007/s002009900019
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:44E292D85602759502687C58D5E802F4FC55E4CELe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Complete Characterization of Termination of 0p 1q→ 1r 0s</title>
<author><name sortKey="Zantema, Hans" sort="Zantema, Hans" uniqKey="Zantema H" first="Hans" last="Zantema">Hans Zantema</name>
</author>
<author><name sortKey="Geser, Alfons" sort="Geser, Alfons" uniqKey="Geser A" first="Alfons" last="Geser">Alfons Geser</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:44E292D85602759502687C58D5E802F4FC55E4CE</idno>
<date when="2000" year="2000">2000</date>
<idno type="doi">10.1007/s002009900019</idno>
<idno type="url">https://api.istex.fr/ark:/67375/VQC-VX72WL03-6/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001022</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001022</idno>
<idno type="wicri:Area/Istex/Curation">001006</idno>
<idno type="wicri:Area/Istex/Checkpoint">002203</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002203</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Complete Characterization of Termination of 0p 1q→ 1r 0s</title>
<author><name sortKey="Zantema, Hans" sort="Zantema, Hans" uniqKey="Zantema H" first="Hans" last="Zantema">Hans Zantema</name>
<affiliation><wicri:noCountry code="subField">NL</wicri:noCountry>
</affiliation>
</author>
<author><name sortKey="Geser, Alfons" sort="Geser, Alfons" uniqKey="Geser A" first="Alfons" last="Geser">Alfons Geser</name>
<affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country>
<placeName><region type="state">Delaware</region>
</placeName>
<wicri:cityArea>Alte Strasse 42, 94034 Passau, Germany (e-mail: geser@fmi.uni-passau.de)</wicri:cityArea>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Applicable Algebra in Engineering, Communication and Computing</title>
<title level="j" type="abbrev">AAECC</title>
<idno type="ISSN">0938-1279</idno>
<idno type="eISSN">1432-0622</idno>
<imprint><publisher>Springer-Verlag</publisher>
<pubPlace>Berlin/Heidelberg</pubPlace>
<date type="published" when="2000-08-01">2000-08-01</date>
<biblScope unit="volume">11</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="1">1</biblScope>
<biblScope unit="page" to="25">25</biblScope>
</imprint>
<idno type="ISSN">0938-1279</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0938-1279</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Keywords: String rewriting, Term rewriting, Termination, Simple termination, Transformation ordering, Dummy elimination, Derivation length.</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract.: We characterize termination of one-rule string rewriting systems of the form 0 p 1 q → 1 r 0 s for every choice of positive integers p, q, r, and s. In doing so we introduce a termination proof method that applies to some hard examples. For the simply terminating cases, i.e. string rewriting systems that can be ordered by a division order, we give the precise complexity of derivation lengths.</div>
</front>
</TEI>
<affiliations><list><country><li>États-Unis</li>
</country>
<region><li>Delaware</li>
</region>
</list>
<tree><noCountry><name sortKey="Zantema, Hans" sort="Zantema, Hans" uniqKey="Zantema H" first="Hans" last="Zantema">Hans Zantema</name>
</noCountry>
<country name="États-Unis"><region name="Delaware"><name sortKey="Geser, Alfons" sort="Geser, Alfons" uniqKey="Geser A" first="Alfons" last="Geser">Alfons Geser</name>
</region>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002203 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 002203 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Istex |étape= Checkpoint |type= RBID |clé= ISTEX:44E292D85602759502687C58D5E802F4FC55E4CE |texte= A Complete Characterization of Termination of 0p 1q→ 1r 0s }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |