default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans Zantema
Person information
- affiliation: Eindhoven University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c62]Hans Zantema:
Characterizing Morphic Sequences. Logics and Type Systems in Theory and Practice 2024: 257-272- [i16]Hans Zantema:
Equality of morphic sequences. CoRR abs/2407.15721 (2024) - 2023
- [i15]Hans Zantema:
Characterizing morphic sequences. CoRR abs/2309.10562 (2023) - 2022
- [j41]Hans Zantema, Wieb Bosma:
Complexity of automatic sequences. Inf. Comput. 288: 104710 (2022) - [c61]Hans Zantema:
Passive Automata Learning: DFAs and NFAs. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 575-580 - [i14]Hans Zantema:
Complexity of Simon's problem in classical sense. CoRR abs/2211.01776 (2022) - 2021
- [j40]Henk Don, Hans Zantema, Michiel de Bondt:
Slowly synchronizing automata with fixed alphabet size. Inf. Comput. 279: 104614 (2021) - [c60]Anna Stramaglia, Jeroen J. A. Keiren
, Hans Zantema:
Deadlock in Packet Switching Networks. FSEN 2021: 127-141 - [i13]Anna Stramaglia, Jeroen J. A. Keiren, Hans Zantema:
Deadlock in packet switching networks. CoRR abs/2101.06015 (2021) - 2020
- [c59]Hans Zantema:
Complexity of Automatic Sequences. LATA 2020: 260-271
2010 – 2019
- 2019
- [j39]Michiel de Bondt, Henk Don, Hans Zantema:
Lower Bounds for Synchronizing Word Lengths in Partial Automata. Int. J. Found. Comput. Sci. 30(1): 29-60 (2019) - [j38]Bas Broere, Hans Zantema:
The k-Dimensional Cube is k-Representable. J. Autom. Lang. Comb. 24(1): 3-12 (2019) - [j37]Henk Don, Hans Zantema:
Counting Symbol Switches in Synchronizing Automata. J. Autom. Lang. Comb. 24(2-4): 253-286 (2019) - [j36]Ö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): 19.2.5 (2019) - 2018
- [j35]Henk Don, Hans Zantema:
Synchronizing Non-Deterministic Finite Automata. J. Autom. Lang. Comb. 23(4): 307-328 (2018) - [j34]Hans Zantema:
Finding small counterexamples for abstract rewriting properties. Math. Struct. Comput. Sci. 28(8): 1485-1505 (2018) - [i12]Michiel de Bondt, Henk Don, Hans Zantema:
Lower Bounds for Synchronizing Word Lengths in Partial Automata. CoRR abs/1801.10436 (2018) - [i11]Henk Don, Hans Zantema:
Counting symbol switches in synchronizing automata. CoRR abs/1812.04050 (2018) - 2017
- [j33]David Sabel, Hans Zantema:
Termination of Cycle Rewriting by Transformation and Matrix Interpretation. Log. Methods Comput. Sci. 13(1) (2017) - [c58]Michiel de Bondt, Henk Don, Hans Zantema:
DFAs and PFAs with Long Shortest Synchronizing Word Length. DLT 2017: 122-133 - [c57]Hans Zantema, Wieb Bosma:
Classifying Non-periodic Sequences by Permutation Transducers. DLT 2017: 365-377 - [c56]Henk Don, Hans Zantema:
Finding DFAs with Maximal Shortest Synchronizing Word Length. LATA 2017: 249-260 - [i10]Michiel de Bondt, Henk Don, Hans Zantema:
DFAs and PFAs with Long Shortest Synchronizing Word Length. CoRR abs/1703.07618 (2017) - [i9]Henk Don, Hans Zantema:
Synchronizing non-deterministic finite automata. CoRR abs/1703.07995 (2017) - 2016
- [j32]Jan Friso Groote, Freek Wiedijk, Hans Zantema:
A Probabilistic Analysis of the Game of the Goose. SIAM Rev. 58(1): 143-155 (2016) - [e1]Andrea Corradini, Hans Zantema:
Proceedings 9th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2016, Eindhoven, The Netherlands, April 8, 2016. EPTCS 225, 2016 [contents] - [i8]Henk Don, Hans Zantema:
Finding DFAs with maximal shortest synchronizing word length. CoRR abs/1609.06853 (2016) - 2015
- [c55]Ruud P. J. Koolen, Tim A. C. Willemse, Hans Zantema:
Using SMT for Solving Fragments of Parameterised Boolean Equation Systems. ATVA 2015: 14-30 - [c54]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema:
The Degree of Squares is an Atom. WORDS 2015: 109-121 - [c53]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: 52-68 - [c52]Jörg Endrullis, Hans Zantema:
Proving non-termination by finite automata. RTA 2015: 160-176 - [c51]David Sabel, Hans Zantema:
Transforming Cycle Rewriting into String Rewriting. RTA 2015: 285-300 - [i7]Jörg Endrullis, Hans Zantema:
Proving Looping and Non-Looping Non-Termination by Finite Automata. CoRR abs/1505.00478 (2015) - [i6]H. J. Sander Bruggink, Barbara König, Dennis Nolte, Hans Zantema:
Proving Termination of Graph Transformation Systems using Weighted Type Graphs over Semirings. CoRR abs/1505.01695 (2015) - [i5]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema:
The Degree of Squares is an Atom (Extended Version). CoRR abs/1506.00884 (2015) - 2014
- [c50]H. J. Sander Bruggink, Barbara König, Hans Zantema:
Termination Analysis for Graph Transformation Systems. IFIP TCS 2014: 179-194 - [c49]Hans Zantema, Barbara König, H. J. Sander Bruggink:
Termination of Cycle Rewriting. RTA-TLCA 2014: 476-490 - [i4]Jörg Endrullis, Hans Zantema:
Non-termination using Regular Languages. CoRR abs/1405.5662 (2014) - 2013
- [j31]Erik P. de Vink, Hans Zantema, Dragan Bosnacki:
RNA-Editing with Combined Insertion and Deletion Preserves Regularity. Sci. Ann. Comput. Sci. 23(1): 39-73 (2013) - [i3]Sebastiaan J. C. Joosten, Hans Zantema:
Relaxation of 3-partition instances. CTW 2013: 133-136 - 2012
- [j30]Aaron Stump, Hans Zantema, Garrin Kimmell, Roba El Haj Omar:
A Rewriting View of Simple Typing. Log. Methods Comput. Sci. 9(1) (2012) - [c48]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: 57-71 - [c47]Vincent van Oostrom, Hans Zantema:
Triangulation in Rewriting. RTA 2012: 240-255 - [c46]Erik P. de Vink, Hans Zantema, Dragan Bosnacki:
Combining Insertion and Deletion in RNA-editing Preserves Regularity. MeCBIC 2012: 48-62 - 2011
- [j29]Jörg Endrullis, Herman Geuvers, Jakob Grue Simonsen, Hans Zantema:
Levels of undecidability in rewriting. Inf. Comput. 209(2): 227-245 (2011) - [j28]Matthias Raffelsieper, Mohammad Reza Mousavi, Hans Zantema:
Long-run order-independence of vector-based transition systems. IET Comput. Digit. Tech. 5(6): 468-478 (2011) - [c45]Hans Zantema, Jörg Endrullis:
Proving Equality of Streams Automatically. RTA 2011: 393-408 - [c44]Hans Zantema:
Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic. WRS 2011: 69-76 - 2010
- [j27]Mousa Mousazadeh, Behrouz Tork Ladani, Hans Zantema:
Liveness Verification in TRSs Using Tree Automata and Termination Analysis. Comput. Informatics 29(3): 407-426 (2010) - [j26]Hans Zantema:
Well-definedness of Streams by Transformation and Termination. Log. Methods Comput. Sci. 6(3) (2010) - [j25]Olga Tveretina, Carsten Sinz, Hans Zantema:
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. J. Satisf. Boolean Model. Comput. 7(1): 35-58 (2010) - [c43]Matthias Raffelsieper, Mohammad Reza Mousavi, Hans Zantema:
Order-Independence of Vector-Based Transition Systems. ACSD 2010: 115-123 - [c42]Hans Zantema:
Complexity of Guided Insertion-Deletion in RNA-Editing. LATA 2010: 608-619 - [c41]Hans Zantema, Matthias Raffelsieper:
Proving Productivity in Infinite Data Structures. RTA 2010: 401-416
2000 – 2009
- 2009
- [c40]Hans Zantema:
A Tool Proving Well-Definedness of Streams Using Termination Tools. CALCO 2009: 449-456 - [c39]Jörg Endrullis, Herman Geuvers, Hans Zantema:
Degrees of Undecidability in Term Rewriting. CSL 2009: 255-270 - [c38]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: 133-148 - [c37]Hans Zantema:
Well-Definedness of Streams by Termination. RTA 2009: 164-178 - [c36]Olga Tveretina, Carsten Sinz, Hans Zantema:
An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas. ACAC 2009: 13-21 - [c35]Hans Zantema, Matthias Raffelsieper:
Stream Productivity by Outermost Termination. WRS 2009: 83-95 - [i2]Jörg Endrullis, Herman Geuvers, Hans Zantema:
Degrees of Undecidability in Rewriting. CoRR abs/0902.4723 (2009) - [i1]Olga Tveretina, Carsten Sinz, Hans Zantema:
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j24]René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp:
Adding constants to string rewriting. Appl. Algebra Eng. Commun. Comput. 19(1): 27-38 (2008) - [j23]Jörg Endrullis, Johannes Waldmann, Hans Zantema:
Matrix Interpretations for Proving Termination of Term Rewriting. J. Autom. Reason. 40(2-3): 195-220 (2008) - [c34]Hans Zantema, Stefan Wagemans, Dragan Bosnacki:
Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets. BIRD 2008: 303-317 - [c33]Hans Zantema:
Normalization of Infinite Terms. RTA 2008: 441-455 - [c32]Adam Koprowski, Hans Zantema:
Certification of Proving Termination of Term Rewriting by Matrix Interpretations. SOFSEM 2008: 328-339 - [c31]Matthias Raffelsieper, Hans Zantema:
A Transformational Approach to Prove Outermost Termination Automatically. WRS@RTA 2008: 3-21 - 2007
- [j22]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
On tree automata that certify termination of left-linear term rewriting systems. Inf. Comput. 205(4): 512-534 (2007) - [j21]Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema:
Generalizing DPLL and satisfiability for equalities. Inf. Comput. 205(8): 1188-1211 (2007) - [c30]Claude Marché, Hans Zantema:
The Termination Competition. RTA 2007: 303-313 - [c29]Hans Zantema, Johannes Waldmann:
Termination by Quasi-periodic Interpretations. RTA 2007: 404-418 - 2006
- [c28]Adam Koprowski, Hans Zantema:
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. IJCAR 2006: 332-346 - [c27]Jörg Endrullis, Johannes Waldmann, Hans Zantema:
Matrix Interpretations for Proving Termination of Term Rewriting. IJCAR 2006: 574-588 - 2005
- [j20]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): 471-486 (2005) - [j19]Hans Zantema:
Termination of String Rewriting Proved Automatically. J. Autom. Reason. 34(2): 105-139 (2005) - [c26]Hans Zantema:
Reducing Right-Hand Sides for Termination. Processes, Terms and Cycles 2005: 173-197 - [c25]Adam Koprowski, Hans Zantema:
Proving Liveness with Fairness Using Rewriting. FroCoS 2005: 232-247 - [c24]Jaco van de Pol, Hans Zantema:
Generalized Innermost Rewriting. RTA 2005: 2-16 - [c23]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. RTA 2005: 353-367 - 2004
- [c22]Olga Tveretina, Hans Zantema:
A Proof System and a Decision Procedure for Equality Logic. LATIN 2004: 530-539 - [c21]Hans Zantema:
TORPA: Termination of Rewriting Proved Automatically. RTA 2004: 95-104 - [c20]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
Finding Finite Automata That Certify Termination of String Rewriting. CIAA 2004: 134-145 - 2003
- [j18]Jan Friso Groote, Hans Zantema:
Resolution and binary decision diagrams cannot simulate each other polynomially. Discret. Appl. Math. 130(2): 157-171 (2003) - [c19]Jürgen Giesl, Hans Zantema:
Liveness in Rewriting. RTA 2003: 321-336 - [c18]Hans Zantema, Jan Friso Groote:
Transforming equality logic to propositional logic. FTP 2003: 162-173 - [c17]Jürgen Giesl, Hans Zantema:
Simulating liveness by reduction strategies. WRS 2003: 641-656 - 2002
- [j17]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178(1): 101-131 (2002) - [j16]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178(1): 132-148 (2002) - [j15]Hans Zantema, Hans L. Bodlaender:
Sizes of Ordered Decision Trees. Int. J. Found. Comput. Sci. 13(3): 445-458 (2002) - 2001
- [j14]Hans Zantema:
The Termination Hierarchy for Term Rewriting. Appl. Algebra Eng. Commun. Comput. 12(1/2): 3-19 (2001) - [j13]Hans Zantema, Jaco van de Pol:
A rewriting approach to binary decision diagrams. J. Log. Algebraic Methods Program. 49(1-2): 61-86 (2001) - [c16]Jan Friso Groote, Hans Zantema:
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially. Ershov Memorial Conference 2001: 33-38 - 2000
- [j12]Hans Zantema, Alfons Geser:
A Complete Characterization of Termination of 0p 1q-> 1r 0s. Appl. Algebra Eng. Commun. Comput. 11(1): 1-25 (2000) - [j11]Hans Zantema, Hans L. Bodlaender:
Finding Small Equivalent Decision Trees is Hard. Int. J. Found. Comput. Sci. 11(2): 343-354 (2000) - [c15]Jaco van de Pol, Hans Zantema:
Binary Decision Diagrams by Shard Rewriting. MFCS 2000: 609-618
1990 – 1999
- 1999
- [j10]Alfons Geser, Hans Zantema:
Non-looping string rewriting. RAIRO Theor. Informatics Appl. 33(3): 279-302 (1999) - 1997
- [j9]Aart Middeldorp, Hans Zantema:
Simple Termination of Rewrite Systems. Theor. Comput. Sci. 175(1): 127-158 (1997) - [j8]Wan J. Fokkink, Hans Zantema:
Termination Modulo Equations by Abstract Commutation with an Application to Iteration. Theor. Comput. Sci. 177(2): 407-423 (1997) - [c14]Hans Zantema:
Termination of Context-Sensitive Rewriting. RTA 1997: 172-186 - [c13]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT 1997: 237-248 - 1996
- [j7]Maria C. F. Ferreira, Hans Zantema:
Total termination of term rewriting. Appl. Algebra Eng. Commun. Comput. 7(2): 133-162 (1996) - [c12]Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema:
Transforming Termination by Self-Labelling. CADE 1996: 373-387 - [c11]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting. CSL 1996: 150-166 - 1995
- [j6]Hans Zantema:
Termination of Term Rewriting by Semantic Labelling. Fundam. Informaticae 24(1/2): 89-105 (1995) - [j5]Hans Zantema:
Total Termination of Term Rewriting is Undecidable. J. Symb. Comput. 20(1): 43-60 (1995) - [c10]Maria C. F. Ferreira, Hans Zantema:
Dummy Elimination: Making Termination Easier. FCT 1995: 243-252 - [c9]Thomas Arts, Hans Zantema:
Termination of Logic Programs Using Semantic Unification. LOPSTR 1995: 219-233 - [c8]Hans Zantema, Alfons Geser:
A Complete Characterization of Termination of Op 1q -> 1r Os. RTA 1995: 41-55 - [c7]H. R. Walters, Hans Zantema:
Rewrite Systems for Integer Arithmetic. RTA 1995: 324-338 - 1994
- [j4]Wan J. Fokkink, Hans Zantema:
Basic Process Algebra with Iteration: Completeness of its Equational Axioms. Comput. J. 37(4): 259-268 (1994) - [j3]Hans Zantema:
Termination of Term Rewriting: Interpretation and Type Elimination. J. Symb. Comput. 17(1): 23-50 (1994) - [c6]Maria C. F. Ferreira, Hans Zantema:
Syntactical Analysis of Total Termination. ALP 1994: 204-222 - [c5]Aart Middeldorp, Hans Zantema:
Simple Termination Revisited. CADE 1994: 451-465 - [c4]Maria C. F. Ferreira, Hans Zantema:
Well-foundedness of Term Orderings. CTRS 1994: 106-123 - 1993
- [c3]Maria C. F. Ferreira, Hans Zantema:
Total Termination of Term Rewriting. RTA 1993: 213-227 - 1992
- [j2]Hans Zantema:
Longest Segment Problems. Sci. Comput. Program. 18(1): 39-66 (1992) - [c2]Hans Zantema:
Type Removal in Term Rewriting. CTRS 1992: 148-154 - [c1]Hans Zantema:
Termination of Term Rewriting by Interpretation. CTRS 1992: 155-167 - 1991
- [j1]Hans Zantema:
Minimizing Sums of Addition Chains. J. Algorithms 12(2): 281-307 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-20 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
