scientific article; zbMATH DE number 1231494

MaRDI QIDQ4222803zbMATH OpenFDO

Authors Richard Kennaway

Publication date 13 December 1998

Full work available at URL http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume2.htm#kennaway

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Recommendations

• Infinite terms and infinite rewritings
• CPO models for infinite term rewriting
• Term rewriting in \(\mathrm{CT}_\Sigma \)
• Infinitary term graph rewriting is simple, sound and complete
• Term graph rewriting

Cited in

(6)

• Repetition-freeness with cyclic relations and chain relations
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Infinite terms and infinite rewritings
• CPO models for infinite term rewriting
• Convergence in infinitary term graph rewriting systems is simple
• On graph rewriting, reduction, and evaluation in the presence of cycles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4222803)