Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

53

Voted

IANDC
2000

favoriteEmaildiscussreport

64views more IANDC 2000»

Bisimilarity in Term Graph Rewriting

15 years 14 days ago

Bisimilarity in Term Graph Rewriting

Download www-users.cs.york.ac.uk

Zena M. Ariola, Jan Willem Klop, Detlef Plump

Real-time Traffic

IANDC 2000 |

claim paper

Related Content

» Parallel Admissible Graph Rewriting

» Narrowing Directed by a Graph of Terms

» A Rewriting Calculus for Multigraphs with Ports

» Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting

» Inequational Deduction as Term Graph Rewriting

» Complexity Analysis by Graph Rewriting

» Complete Strategies for Term Graph Narrowing

» A Heterogeneous Pushout Approach to TermGraph Transformation

» Rank 2 Types for Term Graph Rewriting

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	IANDC
Authors	Zena M. Ariola, Jan Willem Klop, Detlef Plump

Comments (0)