Hans Zantema - RankMe

122 papers A 4B 9C 9Journal 58Unranked 41

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