A GENERAL FRAMEWORK FOR COMPARING SEQUENTIAL AND PARALLEL REWRITINGKLEIJN HCM; ROZENBERG G.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 360-368; BIBL. 8 REF.Conference Paper

Computationally equivalent elimination of conditionsSERBANUTA, Traian Florin; ROSU, Grigore.Lecture notes in computer science. 2006, pp 19-34, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 16 p.Conference Paper

ORDERINGS FOR TERM-REWRITING SYSTEMSDERSHOWITZ N.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 3; PP. 279-301; BIBL. 28 REF.Article

UNIQUE NORMAL FORMS IN TERM REWRITING SYSTEMS WITH REPEATED VARIABLESCHEN P.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/WILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 7-18; BIBL. 5 REF.Conference Paper

CANONICAL FORMS AND UNIFICATIONHULLOT JM.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 87; PP. 318-334; BIBL. 29 REF.Conference Paper

A DEDUCTIVE APPROACH TO PROGRAM SYNTHESISMANNA Z; WALDINGER R.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.1.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 1; PP. 542-551; BIBL. 11 REF.Conference Paper

ON SEQUENTIAL AND PARALLEL-NODE-REWRITING GRAPH GRAMMARSJANSSENS D; ROZENBERG G; VERRAEDT R et al.1982; COMPUT. GRAPH. IMAGE PROCESS.; ISSN 0146-664X; USA; DA. 1982; VOL. 18; NO 3; PP. 219-304; BIBL. 10 REF.Article

REWRITING SYSTEMS WITH LIMITED DISTANCE FORBIDDING CONTEXTVON SOLMS SH.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 11; NO 3-4; PP. 227-239; BIBL. 5 REF.Article

UTILISATION DU CONTEXTE POUR LA DETECTION D'OBJETS FAIBLEMENT CONTRASTESCAMILLERAPP J; CUZON R.1979; RECONNAISSANCE DES FORMES ET INTELLIGENCE ARTIFICIELLE. ASSOCIATION FRANCAISE POUR LA CYBERNETIQUE ECONOMIQUE ET TECHNIQUE. INSTITUT DE RECHERCHE D'INFORMATIQUE ET D'AUTOMATIQUE. CONGRES. 2/1979/TOULOUSE; FRA; ROCQUENCOURT: IRIA; DA. 1979; VOL. 2; PP. 217-224; BIBL. 6 REF.Conference Paper

Parallel modular multiplication with table look-upCHE WUN CHIOU; YANG, T. C.International journal of computer mathematics. 1998, Vol 69, Num 1-2, pp 49-55, issn 0020-7160Article

A uniform framework for term and graph rewriting applied to combined systemsOHLEBUSCH, E.Information processing letters. 2000, Vol 73, Num 1-2, pp 53-59, issn 0020-0190Article

Modular properties of conditional term rewriting systemsMIDDELDORP, A.Information and computation (Print). 1993, Vol 104, Num 1, pp 110-158, issn 0890-5401Article

Knuth-Bendix procedure and non deterministic behavior- an example; Procédure de Knuth-Bendix et indéterminisme - un exempleGNAEDIG, I.Rapports de recherche - INRIA. 1987, Vol 733, issn 0249-6399, 10 p.Report

Communication of Two Stacks and RewritingKARHUMÄKI, Juhani; KUNC, Michal; OKHOTIN, Alexander et al.Lecture notes in computer science. 2006, pp 468-479, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Logicality of conditional rewrite systemsYAMADA, T; AVENHAUS, J; LORIA-SAENZ, C et al.Theoretical computer science. 2000, Vol 236, Num 1-2, pp 209-232, issn 0304-3975Article

Dependency pairs for simply typed term rewritingAOTO, Takahito; YAMADA, Toshiyuki.Lecture notes in computer science. 2005, pp 120-134, issn 0302-9743, isbn 3-540-25596-6, 15 p.Conference Paper

Preuves de terminaison des systèmes de réécriture associatifs commutatifs : une méthode fondée sur la réécriture elle-même = Termination proof for associative commutative rewriting systems: a method bared on the rewriting it-selfGNAEDIG, Isabelle.1986, 73 fThesis

RAPT : A program transformation system based on term rewritingCHIBA, Yuki; AOTO, Takahito.Lecture notes in computer science. 2006, pp 267-276, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 10 p.Conference Paper

TRANSDUCTIONS AND THE PARALLEL GENERATION OF LANGUAGESCULIK K II; HEAD T.1983; INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS; ISSN 0020-7160; GBR; DA. 1983; VOL. 13; NO 1; PP. 3-15; BIBL. 18 REF.Article

ERGODIC LANGUAGESKURKA P.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 3; PP. 351-355; BIBL. 5 REF.Article

UN EXTRACTEUR DE CIRCUIT INTEGRE = AN INTEGRATED CIRCUIT EXTRACTORHEINTZ CHRISTIAN.1982; ; FRA; 78150-LE CHESNAY: IMPR. INST. NATL. RECH. INFORM. AUTOM.; DA. 1982; 127 P.; 30 CM; BIBL. 21 REF.; ISBN 2-7261-0310-3; TH. 3E CYCLE: SCI./PARIS 11/1982Thesis

NEW DECISION ALGORITHMS FOR FINITELY PRESENTED COMMUTATIVE SEMIGROUPSBALLANTYNE AM; LANKFORD DS.1981; COMPUT. MATH. WITH APPL.; ISSN 0097-4943; USA; DA. 1981; VOL. 7; NO 2; PP. 159-165; BIBL. 26 REF.Article

APPLICATION OF GRAPH REWRITING TO OPTIMIZATION AND PARALLELIZATION OF PROGRAMSNAGL M.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; SUPPL. 3; PP. 105-124; ABS. GER; BIBL. 21 REF.Article

ADDING DYNAMIC PARAMODULATION TO REWRITE ALGORITHMSGLOESS PY; LAURENT JPH.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 87; PP. 195-207; BIBL. 9 REF.Conference Paper

ALGORITHMES SEQUENTIELS SUR STRUCTURES DE DONNEES CONCRETESCURIEN PL.1979; LAMBDA CALCUL ET SEMANTIQUE FORMELLE DES LANGAGES DE PROGRAMMATION. ECOLE DE PRINTEMPS D'INFORMATIQUE THEORIQUE. 6/1978/LA CHATRE; FRA; PARIS: LABORATOIRE D'INFORMATIQUE THEORIQUE ET PROGRAMMATION/PARIS: ECOLE NATIONALE SUPERIEURE DE TECHNIQUES AVANCEES; DA. 1979; PP. 157-182; BIBL. 15 REF.Conference Paper