How to Find the Complexity of Algebraic Specifications ?
Identifieur interne : 000851 ( Crin/Corpus ); précédent : 000850; suivant : 000852How to Find the Complexity of Algebraic Specifications ?
Auteurs : R. Schott ; M. TajineSource :
English descriptors
Abstract
In this paper algebraic specifications are interpreted via rewriting systems. We present results concerning the average complexity of\, : \begin{itemize} \item[-] hierarchical term rewriting systems\, : consider a specification S characterized by the rewriting system R. If a new operator op is added to S, we obtain a new system R \cup Rop, where Rop is the set of rules corresponding to op. We show that under some assumptions, the cost-generating function of R \cup Rop can be expressed explicitely in terms of the cost-generating function of R and the arity of op. \item[-] Linear term rewriting systems\, : we prove that under some assumptions, the cost generating function of single rule term rewriting system, is a rational function, easy to compute explicitely. Several classical examples illustrate this part. \end{itemize}
Links to Exploration step
CRIN:schott90aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="363">How to Find the Complexity of Algebraic Specifications ?</title></titleStmt><publicationStmt><idno type="RBID">CRIN:schott90a</idno><date when="1990" year="1990">1990</date><idno type="wicri:Area/Crin/Corpus">000851</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">How to Find the Complexity of Algebraic Specifications ?</title><author><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name></author><author><name sortKey="Tajine, M" sort="Tajine, M" uniqKey="Tajine M" first="M." last="Tajine">M. Tajine</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>algebraic specification</term><term>complexity</term><term>generating function</term><term>term rewriting system</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1858">In this paper algebraic specifications are interpreted via rewriting systems. We present results concerning the average complexity of\, : \begin{itemize} \item[-] hierarchical term rewriting systems\, : consider a specification S characterized by the rewriting system R. If a new operator op is added to S, we obtain a new system R \cup Rop, where Rop is the set of rules corresponding to op. We show that under some assumptions, the cost-generating function of R \cup Rop can be expressed explicitely in terms of the cost-generating function of R and the arity of op. \item[-] Linear term rewriting systems\, : we prove that under some assumptions, the cost generating function of single rule term rewriting system, is a rational function, easy to compute explicitely. Several classical examples illustrate this part. \end{itemize}</div></front></TEI><BibTex type="techreport"><ref>schott90a</ref><crinnumber>90-R-005</crinnumber><category>15</category><equipe>EURECA</equipe><author><e>Schott, R.</e><e>Tajine, M.</e></author><title>How to Find the Complexity of Algebraic Specifications ?</title><institution>Centre de Recherche en Informatique de Nancy</institution><year>1990</year><type>Rapport interne</type><address>Vandoeuvre-lès-Nancy</address><keywords><e>algebraic specification</e><e>complexity</e><e>generating function</e><e>term rewriting system</e></keywords><abstract>In this paper algebraic specifications are interpreted via rewriting systems. We present results concerning the average complexity of\, : \begin{itemize} \item[-] hierarchical term rewriting systems\, : consider a specification S characterized by the rewriting system R. If a new operator op is added to S, we obtain a new system R \cup Rop, where Rop is the set of rules corresponding to op. We show that under some assumptions, the cost-generating function of R \cup Rop can be expressed explicitely in terms of the cost-generating function of R and the arity of op. \item[-] Linear term rewriting systems\, : we prove that under some assumptions, the cost generating function of single rule term rewriting system, is a rational function, easy to compute explicitely. Several classical examples illustrate this part. \end{itemize}</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 000851 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 000851 | 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:schott90a
|texte= How to Find the Complexity of Algebraic Specifications ?
}}
| This area was generated with Dilib version V0.6.33. |  |