Linearizing Term Rewriting Systems Using Test Set
Identifieur interne : 001397 ( Crin/Corpus ); précédent : 001396; suivant : 001398Linearizing Term Rewriting Systems Using Test Set
Auteurs : D. Hofbauer ; M. HuberSource :
- Journal of Symbolic Computation ; 1994.
English descriptors
- KwdEn :
Abstract
Often non left-linear rules in term rewriting systems can be replaced by a finite set of left-linear ones without changing the set of irreducible ground terms. Using appropriate test sets, we can always decide if this is possible and, in case it is, effectively perform such a transformation. We thus can also decide if the set of irreducible ground terms is a regular tree language.
Links to Exploration step
CRIN:hofbauer94aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="176">Linearizing Term Rewriting Systems Using Test Set</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:hofbauer94a</idno>
<date when="1994" year="1994">1994</date>
<idno type="wicri:Area/Crin/Corpus">001397</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Linearizing Term Rewriting Systems Using Test Set</title>
<author><name sortKey="Hofbauer, D" sort="Hofbauer, D" uniqKey="Hofbauer D" first="D." last="Hofbauer">D. Hofbauer</name>
</author>
<author><name sortKey="Huber, M" sort="Huber, M" uniqKey="Huber M" first="M." last="Huber">M. Huber</name>
</author>
</analytic>
<series><title level="j">Journal of Symbolic Computation</title>
<imprint><date when="1994" type="published">1994</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>regular language</term>
<term>term rewriting</term>
<term>tree language</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="596">Often non left-linear rules in term rewriting systems can be replaced by a finite set of left-linear ones without changing the set of irreducible ground terms. Using appropriate test sets, we can always decide if this is possible and, in case it is, effectively perform such a transformation. We thus can also decide if the set of irreducible ground terms is a regular tree language.</div>
</front>
</TEI>
<BibTex type="article"><ref>hofbauer94a</ref>
<crinnumber>94-R-003</crinnumber>
<category>1</category>
<equipe>PROTHEO</equipe>
<author><e>Hofbauer, D.</e>
<e>Huber, M.</e>
</author>
<title>Linearizing Term Rewriting Systems Using Test Set</title>
<journal>Journal of Symbolic Computation</journal>
<year>1994</year>
<volume>17</volume>
<number>1</number>
<pages>91-129</pages>
<month>Jan</month>
<keywords><e>tree language</e>
<e>regular language</e>
<e>term rewriting</e>
</keywords>
<abstract>Often non left-linear rules in term rewriting systems can be replaced by a finite set of left-linear ones without changing the set of irreducible ground terms. Using appropriate test sets, we can always decide if this is possible and, in case it is, effectively perform such a transformation. We thus can also decide if the set of irreducible ground terms is a regular tree language.</abstract>
</BibTex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001397 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 001397 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Crin |étape= Corpus |type= RBID |clé= CRIN:hofbauer94a |texte= Linearizing Term Rewriting Systems Using Test Set }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |