( en | de | ru )

 

Disambiguation of "Zantema, Hans"

Author of the publication

copydeleteadd this publication to your clipboard
Order-Independence of Vector-Based Transition Systems.

, , and . ACSD, page 115-123. IEEE Computer Society, (2010)

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.

Ana Hanstedt

Beurteilung der Entwicklungskompetenz boviner Oozyten aus Follikeln mit unterschiedlicher Durchblutung der Follikelwand. TierH Hannover, (2009)

Flemming Hansen

Standards in der sozialen Arbeit. Uni Kassel, (2009)

Patrick Hansen

Entwicklung eines energetischen Sanierungsmodells für den europäischen Wohngebäudesektor unter dem Aspekt der Erstellung von Szenarien für Energie- und Co_1tn2-Einsparpotenziale bis 2030. Uni Siegen, (2009)

Lang Hans

Walter Hanstein

 

Other publications of authors with the same name

Complexity of Guided Insertion-Deletion in RNA-Editing.. LATA, volume 6031 of Lecture Notes in Computer Science, page 608-619. Springer, (2010)Degrees of Undecidability in Rewriting, , and . CoRR, (2009)Finding DFAs with maximal shortest synchronizing word length., and . CoRR, (2016)Proving Looping and Non-Looping Non-Termination by Finite Automata., and . CoRR, (2015)Triangulation in Rewriting., and . RTA, volume 15 of LIPIcs, page 240-255. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic. WRS, volume 82 of EPTCS, page 69-76. (2011)Dummy Elimination: Making Termination Easier., and . FCT, volume 965 of Lecture Notes in Computer Science, page 243-252. Springer, (1995)Transforming Termination by Self-Labelling., , and . CADE, volume 1104 of Lecture Notes in Computer Science, page 373-387. Springer, (1996)Termination of Term Rewriting by Semantic Labelling.. Fundam. Informaticae, 24 (1/2): 89-105 (1995)Longest Segment Problems.. Sci. Comput. Program., 18 (1): 39-66 (1992)