The following pages link to Hans Zantema (Q505038):
Displaying 50 items.
- (Q199238) (redirect page) (← links)
- Ordering sequences by permutation transducers (Q505039) (← links)
- Levels of undecidability in rewriting (Q627134) (← links)
- Termination of string rewriting proved automatically (Q850497) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
- Adding constants to string rewriting (Q945008) (← links)
- Global restrictions on ramification in number fields (Q1054785) (← links)
- Longest segment problems (Q1190849) (← links)
- Termination of term rewriting: Interpretation and type elimination (Q1332336) (← links)
- A rewriting approach to binary decision diagrams (Q1349250) (← links)
- Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378) (← links)
- A complete characterization of termination of \(0^p1^q\to 1^r0^s\) (Q1583881) (← links)
- Integer valued polynomials over a number field (Q1835950) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- Total termination of term rewriting is undecidable (Q1911402) (← links)
- Total termination of term rewriting (Q1912706) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Deadlock in packet switching networks (Q2145272) (← links)
- DFAs and PFAs with long shortest synchronizing word length (Q2408797) (← links)
- Classifying non-periodic sequences by permutation transducers (Q2408815) (← links)
- Generalizing DPLL and satisfiability for equalities (Q2643080) (← links)
- Well-definedness of Streams by Transformation and Termination (Q2786138) (← links)
- A Probabilistic Analysis of the Game of the Goose (Q2808273) (← links)
- (Q2818569) (← links)
- (Q2844067) (← links)
- A Tool Proving Well-Definedness of Streams Using Termination Tools (Q2888504) (← links)
- Cinderella versus the Wicked Stepmother (Q2915161) (← links)
- Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings (Q2947210) (← links)
- (Q2970215) (← links)
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation (Q2980975) (← links)
- (Q3006476) (← links)
- SIZES OF ORDERED DECISION TREES (Q3021963) (← links)
- (Q3043797) (← links)
- (Q3075128) (← links)
- Solving computational problems in the theory of word-representable graphs (Q3120420) (← links)
- Termination Analysis for Graph Transformation Systems (Q3190160) (← links)
- Minimizing sums of addition chains (Q3351437) (← links)
- The Degree of Squares is an Atom (Q3449362) (← links)
- Using SMT for Solving Fragments of Parameterised Boolean Equation Systems (Q3460542) (← links)
- Normalization of Infinite Terms (Q3522036) (← links)
- Complexity of Guided Insertion-Deletion in RNA-Editing (Q3564900) (← links)
- Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems (Q3613418) (← links)
- Matrix Interpretations for Proving Termination of Term Rewriting (Q3613435) (← links)
- Well-Definedness of Streams by Termination (Q3636825) (← links)
- Degrees of Undecidability in Term Rewriting (Q3644753) (← links)
- A computation concerning doubly transitive permutation groups. (Q3661777) (← links)
