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.
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).
Finding small counter examples for abstract rewriting propertiesMathematical Structures in Computer Science (2018)
Ordering sequences by permutation transducersIndagationes Mathematicae (2017)
Classifying non-periodic sequences by permutation transducersDevelopments in Langauge Theory"21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings (2017)
DFAs and PFAs with long shortest synchronizing word length21st International Conference on Developments in Language Theory (DLT 2017), August 7-11, 2017, Liege, Belgium (2017)
Finding DFAs with maximal shortest synchronizing word lengthLanguage and Automata Theory and Applications (2017)
- Automata, language theory and complexity
- Logic and set theory for P&T
- Automated reasoning
- Fundamentals of informatics
- Discrete structures
No ancillary activities