Als u wijzigingen in Pure hebt gemaakt, zullen deze hier binnenkort zichtbaar zijn.

Persoonlijk profiel

Research profile

Hans Zantema is an Associate Professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e) and part time Full Professor at Radboud University in Nijmegen. His main areas of expertise include algorithms, automated reasoning, term rewriting systems, automata theory and constraint solving (systems). His focus areas include the theory behind these topics, and obtaining insight into how various problems can be transformed to formulas, and solved automatically by computer programs manipulating these formulas.

Hans is known for his achievements in term rewriting systems, in particular in automatically proving termination of term rewriting. His name is attached to ‘Zantema's problem’: does the string rewrite system 0011 -> 111000 terminate.

Academic background

Hans Zantema received his PhD in algebraic number theory in 1983 from the University of Amsterdam for his thesis entitled ‘Integer Valued Polynomials in Algebraic Number Theory’. After graduation, Zantema worked at Philips Data Systems for some years, after which he switched to academia. From 1987 to 2000 Hans worked at Utrecht University and in 2000 he joined TU/e.

In addition to his position at TU/e, Hans obtained his position at Radboud University in Nijmegen in 2007. Hans has been an organizer for RDP 2013, including the conferences RTA and TLCA, and workshops, and ISR 2017: International School on Rewriting. He also developed several tools: TORPA (termination of rewriting proved automatically), CARPA (counter examples in abstract rewriting produced automatically) and REPRNR (computes the representation number of a graph).

Vingerafdruk Duik in de onderzoeksthema's waar Hans Zantema actief is. Deze onderwerplabels komen voort uit het werk van deze persoon. Samen vormen ze een unieke vingerafdruk.

Rewriting Rekenkunde
Termination Rekenkunde
Normal Form Rekenkunde
Formal languages Engineering en materiaalwetenschappen
Undecidability Rekenkunde
Strings Rekenkunde
Finite Automata Rekenkunde
Automata Rekenkunde

Netwerk Recente externe samenwerking op landenniveau. Duik in de details door op de stippen te klikken.

Onderzoeksoutput 1980 2019

1 Citaat (Scopus)

Counting symbol switches in synchronizing automata

Don, H. & Zantema, H., 1 jan 2019, In : Journal of Automata, Languages and Combinatorics. 24, 2-4, blz. 253-286 34 blz.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Automata
Counting
Switch
Count
Switches
3 Citaties (Scopus)

Lower bounds for synchronizing word lengths in partial automata

de Bondt, M., Don, H. M. & Zantema, H., 2019, In : International Journal of Foundations of Computer Science. 30, 1, blz. 29-60 32 blz.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Synchronization

Solving computational problems in the theory of word-representable graphs

Akgün, Ö., Gent, I., Kitaev, S. & Zantema, H., 2019, In : Journal of Integer Sequences. 22, 2, 18 blz., 19.2.5.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Graph in graph theory
Representability
Comparability Graph
Graph Representation
Odd number

The k-dimensional cube is k-representable

Broere, B. & Zantema, H., 2019, In : Journal of Automata, Languages and Combinatorics. 24, 1, blz. 3-12 10 blz.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Regular hexahedron
Vertex of a graph
Concatenation
Cartesian product
Graph in graph theory

Counting symbol switches in synchronizing automata

Don, H. M. & Zantema, H., 2018, In : arXiv. 26 blz., 1812.04050v1 .

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademic

Open Access
Bestand
Automata
Counting
Switch
Count
Synchronization

Cursussen

Applied Logic

1/09/19 → …

Cursus

Automated reasoning

1/09/15 → …

Cursus

Fundamentals of informatics

1/09/1331/08/20

Cursus

Logic and set theory for P&T

1/09/1831/08/21

Cursus

Scriptie

Automatically proving equality of infinite sequences

Auteur: Roelofs, S., 28 okt 2019

Begeleider: Zantema, H. (Afstudeerdocent 1)

Scriptie/masterproef: Master

Bestand

Comparison of techniques for solving reachability problems

Auteur: van Ballegooij, P., 30 apr 2006

Begeleider: Zantema, H. (Afstudeerdocent 1)

Scriptie/masterproef: Master

Bestand

Finding maximal frequent subgraphs

Auteur: Wagemans, J., 30 jun 2008

Begeleider: Zantema, H. (Afstudeerdocent 1) & Bosnacki, D. (Afstudeerdocent 2)

Scriptie/masterproef: Master

Bestand

Optimal instruction scheduling and register allocation for coarse-grained reconfigurable architectures

Auteur: Tiemersma, A., 24 apr 2017

Begeleider: Corporaal, H. (Afstudeerdocent 1), Jordans, R. (Afstudeerdocent 2) & Zantema, H. (Afstudeerdocent 2)

Scriptie/masterproef: Master

Bestand

Physical design automation: automatic placement and routing for analog chip designs

Auteur: van Otterdijk, P., 30 sep 2011

Begeleider: Zantema, H. (Afstudeerdocent 1)

Scriptie/masterproef: Master

Bestand