Hans Zantema

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 26

Top Venues

CoRR

J. Autom. Lang. Comb.

DLT

LATA

Publications

Hans Zantema
Characterizing Morphic Sequences. Logics and Type Systems in Theory and Practice (2024)
Hans Zantema
Equality of morphic sequences. CoRR (2024)
Hans Zantema
Characterizing morphic sequences. CoRR (2023)
Hans Zantema
Complexity of Simon's problem in classical sense. CoRR (2022)
Hans Zantema, Wieb Bosma
Complexity of automatic sequences. Inf. Comput. 288 (2022)
Hans Zantema
Passive Automata Learning: DFAs and NFAs. A Journey from Process Algebra via Timed Automata to Model Learning (2022)
Henk Don, Hans Zantema, Michiel de Bondt
Slowly synchronizing automata with fixed alphabet size. Inf. Comput. 279 (2021)
Anna Stramaglia, Jeroen J. A. Keiren, Hans Zantema
Deadlock in packet switching networks. CoRR (2021)
Anna Stramaglia, Jeroen J. A. Keiren, Hans Zantema
Deadlock in Packet Switching Networks. FSEN (2021)
Hans Zantema
Complexity of Automatic Sequences. LATA (2020)
Michiel de Bondt, Henk Don, Hans Zantema
Lower Bounds for Synchronizing Word Lengths in Partial Automata. Int. J. Found. Comput. Sci. 30 (1) (2019)
Özgür Akgün, Ian P. Gent, Sergey Kitaev, Hans Zantema
Solving Computational Problems in the Theory of Word-Representable Graphs. J. Integer Seq. 22 (2) (2019)
Bas Broere, Hans Zantema
-Representable. J. Autom. Lang. Comb. 24 (1) (2019)
Henk Don, Hans Zantema
Counting Symbol Switches in Synchronizing Automata. J. Autom. Lang. Comb. 24 (2-4) (2019)
Henk Don, Hans Zantema
Synchronizing Non-Deterministic Finite Automata. J. Autom. Lang. Comb. 23 (4) (2018)
Hans Zantema
Finding small counterexamples for abstract rewriting properties. Math. Struct. Comput. Sci. 28 (8) (2018)
Henk Don, Hans Zantema
Counting symbol switches in synchronizing automata. CoRR (2018)
Michiel de Bondt, Henk Don, Hans Zantema
Lower Bounds for Synchronizing Word Lengths in Partial Automata. CoRR (2018)
Henk Don, Hans Zantema
Synchronizing non-deterministic finite automata. CoRR (2017)
Henk Don, Hans Zantema
Finding DFAs with Maximal Shortest Synchronizing Word Length. LATA (2017)
Michiel de Bondt, Henk Don, Hans Zantema
DFAs and PFAs with Long Shortest Synchronizing Word Length. CoRR (2017)
David Sabel, Hans Zantema
Termination of Cycle Rewriting by Transformation and Matrix Interpretation. Log. Methods Comput. Sci. 13 (1) (2017)
Michiel de Bondt, Henk Don, Hans Zantema
DFAs and PFAs with Long Shortest Synchronizing Word Length. DLT (2017)
Hans Zantema, Wieb Bosma
Classifying Non-periodic Sequences by Permutation Transducers. DLT (2017)
Henk Don, Hans Zantema
Finding DFAs with maximal shortest synchronizing word length. CoRR (2016)
Jan Friso Groote, Freek Wiedijk, Hans Zantema
A Probabilistic Analysis of the Game of the Goose. SIAM Rev. 58 (1) (2016)
Ruud P. J. Koolen, Tim A. C. Willemse, Hans Zantema
Using SMT for Solving Fragments of Parameterised Boolean Equation Systems. ATVA (2015)
H. J. Sander Bruggink, Barbara König, Dennis Nolte, Hans Zantema
Proving Termination of Graph Transformation Systems using Weighted Type Graphs over Semirings. CoRR (2015)
H. J. Sander Bruggink, Barbara König, Dennis Nolte, Hans Zantema
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings. ICGT (2015)
Jörg Endrullis, Hans Zantema
Proving Looping and Non-Looping Non-Termination by Finite Automata. CoRR (2015)
David Sabel, Hans Zantema
Transforming Cycle Rewriting into String Rewriting. RTA (2015)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema
The Degree of Squares is an Atom (Extended Version). CoRR (2015)
Jörg Endrullis, Hans Zantema
Proving non-termination by finite automata. RTA (2015)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema
The Degree of Squares is an Atom. WORDS (2015)
H. J. Sander Bruggink, Barbara König, Hans Zantema
Termination Analysis for Graph Transformation Systems. IFIP TCS (2014)
Hans Zantema, Barbara König, H. J. Sander Bruggink
Termination of Cycle Rewriting. RTA-TLCA (2014)
Jörg Endrullis, Hans Zantema
Non-termination using Regular Languages. CoRR (2014)
Sebastiaan J. C. Joosten, Hans Zantema
Relaxation of 3-partition instances. CTW (2013)
Erik P. de Vink, Hans Zantema, Dragan Bosnacki
RNA-Editing with Combined Insertion and Deletion Preserves Regularity. Sci. Ann. Comput. Sci. 23 (1) (2013)
Marijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema
Cinderella versus the Wicked Stepmother. IFIP TCS (2012)
Vincent van Oostrom, Hans Zantema
Triangulation in Rewriting. RTA (2012)
Erik P. de Vink, Hans Zantema, Dragan Bosnacki
Combining Insertion and Deletion in RNA-editing Preserves Regularity MeCBIC (2012)
Aaron Stump, Hans Zantema, Garrin Kimmell, Roba El Haj Omar
A Rewriting View of Simple Typing Log. Methods Comput. Sci. 9 (1) (2012)
Matthias Raffelsieper, Mohammad Reza Mousavi, Hans Zantema
Long-run order-independence of vector-based transition systems. IET Comput. Digit. Tech. 5 (6) (2011)
Jörg Endrullis, Herman Geuvers, Jakob Grue Simonsen, Hans Zantema
Levels of undecidability in rewriting. Inf. Comput. 209 (2) (2011)
Hans Zantema
Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic WRS (2011)
Hans Zantema, Jörg Endrullis
Proving Equality of Streams Automatically. RTA (2011)
Olga Tveretina, Carsten Sinz, Hans Zantema
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. J. Satisf. Boolean Model. Comput. 7 (1) (2010)
Matthias Raffelsieper, Mohammad Reza Mousavi, Hans Zantema
Order-Independence of Vector-Based Transition Systems. ACSD (2010)
Mousa Mousazadeh, Behrouz Tork Ladani, Hans Zantema
Liveness Verification in TRSs Using Tree Automata and Termination Analysis. Comput. Informatics 29 (3) (2010)
Hans Zantema
Well-definedness of Streams by Transformation and Termination Log. Methods Comput. Sci. 6 (3) (2010)
Hans Zantema
Complexity of Guided Insertion-Deletion in RNA-Editing. LATA (2010)
Hans Zantema, Matthias Raffelsieper
Proving Productivity in Infinite Data Structures. RTA (2010)
Hans Zantema
A Tool Proving Well-Definedness of Streams Using Termination Tools. CALCO (2009)
Jörg Endrullis, Herman Geuvers, Hans Zantema
Degrees of Undecidability in Rewriting CoRR (2009)
Olga Tveretina, Carsten Sinz, Hans Zantema
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. Electron. Colloquium Comput. Complex. 16 (2009)
Matthias Raffelsieper, Hans Zantema
A Transformational Approach to Prove Outermost Termination Automatically. Electron. Notes Theor. Comput. Sci. 237 (2009)
Hans Zantema, Matthias Raffelsieper
Stream Productivity by Outermost Termination WRS (2009)
Hans Zantema
Well-Definedness of Streams by Termination. RTA (2009)
Olga Tveretina, Carsten Sinz, Hans Zantema
An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas ACAC (2009)
Matthias Raffelsieper, Mohammad Reza Mousavi, Jan-Willem Roorda, Chris W. H. Strolenberg, Hans Zantema
Formal Analysis of Non-determinism in Verilog Cell Library Simulation Models. FMICS (2009)
Jörg Endrullis, Herman Geuvers, Hans Zantema
Degrees of Undecidability in Term Rewriting. CSL (2009)
Adam Koprowski, Hans Zantema
Certification of Proving Termination of Term Rewriting by Matrix Interpretations. SOFSEM (2008)
René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp
Adding constants to string rewriting. Appl. Algebra Eng. Commun. Comput. 19 (1) (2008)
Hans Zantema
Normalization of Infinite Terms. RTA (2008)
Jörg Endrullis, Johannes Waldmann, Hans Zantema
Matrix Interpretations for Proving Termination of Term Rewriting. J. Autom. Reason. 40 (2-3) (2008)
Hans Zantema, Stefan Wagemans, Dragan Bosnacki
Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets. BIRD (2008)
Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema
Generalizing DPLL and satisfiability for equalities. Inf. Comput. 205 (8) (2007)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
On tree automata that certify termination of left-linear term rewriting systems. Inf. Comput. 205 (4) (2007)
Claude Marché, Hans Zantema
The Termination Competition. RTA (2007)
Hans Zantema, Johannes Waldmann
Termination by Quasi-periodic Interpretations. RTA (2007)
Adam Koprowski, Hans Zantema
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. IJCAR (2006)
Jörg Endrullis, Johannes Waldmann, Hans Zantema
Matrix Interpretations for Proving Termination of Term Rewriting. IJCAR (2006)
Jaco van de Pol, Hans Zantema
Generalized Innermost Rewriting. RTA (2005)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. RTA (2005)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
Finding finite automata that certify termination of string rewriting systems. Int. J. Found. Comput. Sci. 16 (3) (2005)
Hans Zantema
Termination of String Rewriting Proved Automatically. J. Autom. Reason. 34 (2) (2005)
Adam Koprowski, Hans Zantema
Proving Liveness with Fairness Using Rewriting. FroCoS (2005)
Hans Zantema
Reducing Right-Hand Sides for Termination. Processes, Terms and Cycles (2005)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
Finding Finite Automata That Certify Termination of String Rewriting. CIAA (2004)
Hans Zantema
TORPA: Termination of Rewriting Proved Automatically. RTA (2004)
Olga Tveretina, Hans Zantema
A Proof System and a Decision Procedure for Equality Logic. LATIN (2004)
Jürgen Giesl, Hans Zantema
Simulating liveness by reduction strategies. Electron. Notes Theor. Comput. Sci. 86 (4) (2003)
Jan Friso Groote, Hans Zantema
Resolution and binary decision diagrams cannot simulate each other polynomially. Discret. Appl. Math. 130 (2) (2003)
Hans Zantema, Jan Friso Groote
Transforming equality logic to propositional logic. Electron. Notes Theor. Comput. Sci. 86 (1) (2003)
Jürgen Giesl, Hans Zantema
Liveness in Rewriting. RTA (2003)
Hans Zantema, Hans L. Bodlaender
Sizes of Ordered Decision Trees. Int. J. Found. Comput. Sci. 13 (3) (2002)
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178 (1) (2002)
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178 (1) (2002)
Hans Zantema, Jaco van de Pol
A rewriting approach to binary decision diagrams. J. Log. Algebraic Methods Program. 49 (1-2) (2001)
Hans Zantema
The Termination Hierarchy for Term Rewriting. Appl. Algebra Eng. Commun. Comput. 12 (1/2) (2001)
Jan Friso Groote, Hans Zantema
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially. Ershov Memorial Conference (2001)
Hans Zantema, Alfons Geser
. Appl. Algebra Eng. Commun. Comput. 11 (1) (2000)
Jaco van de Pol, Hans Zantema
Binary Decision Diagrams by Shard Rewriting. MFCS (2000)
Hans Zantema, Hans L. Bodlaender
Finding Small Equivalent Decision Trees is Hard. Int. J. Found. Comput. Sci. 11 (2) (2000)
Alfons Geser, Hans Zantema
Non-looping string rewriting. RAIRO Theor. Informatics Appl. 33 (3) (1999)
Aart Middeldorp, Hans Zantema
Simple Termination of Rewrite Systems. Theor. Comput. Sci. 175 (1) (1997)
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT (1997)
Wan J. Fokkink, Hans Zantema
Termination Modulo Equations by Abstract Commutation with an Application to Iteration. Theor. Comput. Sci. 177 (2) (1997)
Hans Zantema
Termination of Context-Sensitive Rewriting. RTA (1997)

Hans Zantema.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hans Zantema