Research Output per year

## Personal profile

### 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).

##
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.

## Research Output 1980 2019

## 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, p. 29-60 32 p.Research output: Contribution to journal › Article › Academic › peer-review

## 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 p., 19.2.5Research output: Contribution to journal › Article › Academic › peer-review

## The k-dimensional cube is k-representable

Broere, B. & Zantema, H., 2019, In : Journal of Automata, Languages and Combinatorics. 24, 1, p. 3-12 10 p.Research output: Contribution to journal › Article › Academic › peer-review

## Counting symbol switches in synchronizing automata

Don, H. M. & Zantema, H., 2018, In : arXiv. 26 p., 1812.04050v1Research output: Contribution to journal › Article › Academic

## Finding small counter examples for abstract rewriting properties

Zantema, H., 1 Sep 2018, In : Mathematical Structures in Computer Science. 28, 8, p. 1485-1505 21 p.Research output: Contribution to journal › Article › Academic › peer-review

## Courses

## Student theses

## Comparison of techniques for solving reachability problems

Author: van Ballegooij, P., 30 Apr 2006Supervisor: Zantema, H. (Supervisor 1)

Student thesis: Master

## Finding maximal frequent subgraphs

Author: Wagemans, J., 30 Jun 2008Supervisor: Zantema, H. (Supervisor 1) & Bosnacki, D. (Supervisor 2)

Student thesis: Master

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

Author: Tiemersma, A., 24 Apr 2017Supervisor: Corporaal, H. (Supervisor 1), Jordans, R. (Supervisor 2) & Zantema, H. (Supervisor 2)

Student thesis: Master

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

Author: van Otterdijk, P., 30 Sep 2011Supervisor: Zantema, H. (Supervisor 1)

Student thesis: Master

## Proving $SN\sp \infty$ automatically

Author: Hermans, F., 31 Oct 2008Supervisor: Zantema, H. (Supervisor 1)

Student thesis: Master