Titlebook: Rewriting Techniques and Applications; 8th International Co Hubert Comon Conference proceedings 1997 Springer-Verlag Berlin Heidelberg 1997

存貨清單

書目名稱Rewriting Techniques and Applications影響因子(影響力)




書目名稱Rewriting Techniques and Applications影響因子(影響力)學(xué)科排名




書目名稱Rewriting Techniques and Applications網(wǎng)絡(luò)公開度




書目名稱Rewriting Techniques and Applications網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Rewriting Techniques and Applications被引頻次




書目名稱Rewriting Techniques and Applications被引頻次學(xué)科排名




書目名稱Rewriting Techniques and Applications年度引用




書目名稱Rewriting Techniques and Applications年度引用學(xué)科排名




書目名稱Rewriting Techniques and Applications讀者反饋




書目名稱Rewriting Techniques and Applications讀者反饋學(xué)科排名

flavonoids

乏味

0302-9743 aches to rewriting are presented. All in all, this volume presents the state of the art in the area of rewriting techniques and applications.978-3-540-62950-4978-3-540-69051-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

單調(diào)性

HARP

Acupressure

Conditional equational specifications of data types with partial operations for inductive theorem pk for inductive theorem proving. The language requires constructors for designating data items and admits positive/negative conditional equations as axioms in specifications. The (total algebra) semantics for such specifications is based on so-called data models. We develop admissibility conditions

緯線

Cross-sections for finitely presented monoids with decidable word problems,ft-recursive convergent string-rewriting system. However, regular cross-sections or even context-free cross-sections do not suffice. This is shown by presenting examples of finitely presented monoids with decidable word problems that do not admit regular cross-sections, and that, hence, cannot be pr

Harbor

inspired

On the property of preserving regularity for string-rewriting systems, (1995). In particular, it is shown that it is undecidable in general whether a finite, length-reducing, and confluent stringre-writing system yields a regular set of normal forms for each regular language.

一條卷發(fā)