Modeling terms by graphs with structure constraints (two illustrations)

MaRDI QIDQ5018493zbMATH OpenFDO

Authors Clemens Grabmayer

Publication date 20 December 2021

Full work available at URL https://arxiv.org/abs/1902.02010, http://eptcs.web.cse.unsw.edu.au/paper.cgi?TERMGRAPH2018.1

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Essentials of term graph rewriting
• scientific article; zbMATH DE number 2016092
• Proceedings of the 6th international workshop on computing with terms and graphs, TERMGRAPH 2011, Saarbrücken, Germany, April 2, 2011
• Proceedings of the 7th international workshop on computing with terms and graphs, TERMGRAPH 2013, Rome, Italy, March, 23, 2013
• An abstract view on syntax with sharing

Cites work

• A characterization of regular expressions under bisimulation
• A complete inference system for a class of regular behaviours
• An Equational Axiomatization of Bisimulation over Regular Expressions
• Axiomatizations for the perpetual loop in process algebra
• scientific article; zbMATH DE number 3918329 (Why is no real title available?)
• Maximal sharing in the lambda calculus with letrec
• Nested term graphs (work in progress)
• Partial derivatives of regular expressions and finite automaton constructions
• Proceedings of the 7th international workshop on computing with terms and graphs, TERMGRAPH 2013, Rome, Italy, March, 23, 2013
• Two Complete Axiom Systems for the Algebra of Regular Events

Cited in

(1)

• From compactifying lambda-letrec terms to recognizing regular-expression processes (extended abstract and literature)

This page was built for publication: Modeling terms by graphs with structure constraints (two illustrations)

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