( en | de | ru )

 

Disambiguation of "Bruggink, Sander H. J."

Author of the publication

copydeleteadd this publication to your clipboard
Towards a Systematic Method for Proving Termination of Graph Transformation Systems

. Electronic Notes in Theoretical Computer Science, 213 (1): 23--38 (May 2008)
DOI: http://dx.doi.org/10.1016/j.entcs.2008.04.072

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

H J Plüss

H -J Bielig

J. H. Merkin

J H Mazaheri

H J Reeb

 

Other publications of authors with the same name

Towards Process Mining with Graph Transformation Systems.. ICGT, volume 8571 of Lecture Notes in Computer Science, page 253-268. Springer, (2014)Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages., and . ECEASST, (2011)Towards a Systematic Method for Proving Termination of Graph Transformation Systems. Electronic Notes in Theoretical Computer Science, 213 (1): 23--38 (May 2008)A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property.. RTA, volume 4098 of Lecture Notes in Computer Science, page 372-386. Springer, (2006)Towards a Systematic Method for Proving Termination of Graph Transformation Systems.. GT-VC@CONCUR, volume 213 of Electronic Notes in Theoretical Computer Science, page 23-38. Elsevier, (2007)Residuals in Higher-Order Rewriting.. RTA, volume 2706 of Lecture Notes in Computer Science, page 123-137. Springer, (2003)A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java., , , , and . ICGT, volume 12150 of Lecture Notes in Computer Science, page 297-306. Springer, (2020)