Hans Zantema

CoRR, 2024

Characterizing Morphic Sequences.

[BibT_eX]

[DOI]

Proceedings of the Logics and Type Systems in Theory and Practice, 2024

2022

Complexity of automatic sequences.

[BibT_eX]

[DOI]

Wieb Bosma

Inf. Comput., 2022

Complexity of Simon's problem in classical sense.

[BibT_eX]

[DOI]

CoRR, 2022

Passive Automata Learning: DFAs and NFAs.

[BibT_eX]

[DOI]

Proceedings of the A Journey from Process Algebra via Timed Automata to Model Learning, 2022

2021

Slowly synchronizing automata with fixed alphabet size.

[BibT_eX]

[DOI]

Michiel de Bondt

Inf. Comput., 2021

Deadlock in Packet Switching Networks.

[BibT_eX]

[DOI]

Anna Stramaglia

Jeroen J. A. Keiren

Proceedings of the Fundamentals of Software Engineering - 9th International Conference, 2021

2020

Complexity of Automatic Sequences.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2020

2019

Solving Computational Problems in the Theory of Word-Representable Graphs.

[BibT_eX]

[DOI]

J. Integer Seq., 2019

Counting Symbol Switches in Synchronizing Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2019

The k-Dimensional Cube is k-Representable.

[BibT_eX]

[DOI]

Bas Broere

J. Autom. Lang. Comb., 2019

Lower Bounds for Synchronizing Word Lengths in Partial Automata.

[BibT_eX]

[DOI]

Michiel de Bondt

Int. J. Found. Comput. Sci., 2019

2018

Finding small counterexamples for abstract rewriting properties.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2018

Synchronizing Non-Deterministic Finite Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2018

2017

Termination of Cycle Rewriting by Transformation and Matrix Interpretation.

[BibT_eX]

[DOI]

David Sabel

Log. Methods Comput. Sci., 2017

Finding DFAs with Maximal Shortest Synchronizing Word Length.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2017

Classifying Non-periodic Sequences by Permutation Transducers.

[BibT_eX]

[DOI]

Wieb Bosma

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

DFAs and PFAs with Long Shortest Synchronizing Word Length.

[BibT_eX]

[DOI]

Michiel de Bondt

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

A Probabilistic Analysis of the Game of the Goose.

[BibT_eX]

[DOI]

Jan Friso Groote

Freek Wiedijk

SIAM Rev., 2016

2015

Proving Looping and Non-Looping Non-Termination by Finite Automata.

[BibT_eX]

[DOI]

CoRR, 2015

The Degree of Squares is an Atom (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2015

Transforming Cycle Rewriting into String Rewriting.

[BibT_eX]

[DOI]

David Sabel

Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Proving non-termination by finite automata.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings.

[BibT_eX]

[DOI]

H. J. Sander Bruggink

Barbara König

Dennis Nolte

Proceedings of the Graph Transformation - 8th International Conference, 2015

The Degree of Squares is an Atom.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

Using SMT for Solving Fragments of Parameterised Boolean Equation Systems.

[BibT_eX]

[DOI]

Ruud P. J. Koolen

Tim A. C. Willemse

Proceedings of the Automated Technology for Verification and Analysis, 2015

2014

Non-termination using Regular Languages.

[BibT_eX]

[DOI]

CoRR, 2014

Termination of Cycle Rewriting.

[BibT_eX]

[DOI]

Barbara König

H. J. Sander Bruggink

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Termination Analysis for Graph Transformation Systems.

[BibT_eX]

[DOI]

H. J. Sander Bruggink

Barbara König

Proceedings of the Theoretical Computer Science, 2014

2013

RNA-Editing with Combined Insertion and Deletion Preserves Regularity.

[BibT_eX]

[DOI]

Erik P. de Vink

Dragan Bosnacki

Sci. Ann. Comput. Sci., 2013

Relaxation of 3-partition instances.

[BibT_eX]

Sebastiaan J. C. Joosten

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Combining Insertion and Deletion in RNA-editing Preserves Regularity

[BibT_eX]

[DOI]

Erik P. de Vink

Dragan Bosnacki

Proceedings of the Proceedings 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2012

A Rewriting View of Simple Typing

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

Triangulation in Rewriting.

[BibT_eX]

[DOI]

Vincent van Oostrom

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Cinderella versus the Wicked Stepmother.

[BibT_eX]

[DOI]

Marijke H. L. Bodlaender

Cor A. J. Hurkens

Vincent J. J. Kusters

Frank Staals

Gerhard J. Woeginger

Proceedings of the Theoretical Computer Science, 2012

2011

Long-run order-independence of vector-based transition systems.

[BibT_eX]

[DOI]

Mohammad Reza Mousavi

IET Comput. Digit. Tech., 2011

Levels of undecidability in rewriting.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic

[BibT_eX]

[DOI]

Proceedings of the Proceedings 10th International Workshop on Reduction Strategies in Rewriting and Programming, 2011

Proving Equality of Streams Automatically.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2010

Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond.

[BibT_eX]

[DOI]

Olga Tveretina

Carsten Sinz

J. Satisf. Boolean Model. Comput., 2010

Well-definedness of Streams by Transformation and Termination

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

Liveness Verification in TRSs Using Tree Automata and Termination Analysis.

[BibT_eX]

[DOI]

Mousa Mousazadeh

Behrouz Tork Ladani

Comput. Informatics, 2010

Proving Productivity in Infinite Data Structures.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Complexity of Guided Insertion-Deletion in RNA-Editing.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2010

Order-Independence of Vector-Based Transition Systems.

[BibT_eX]

[DOI]

Mohammad Reza Mousavi

Proceedings of the 10th International Conference on Application of Concurrency to System Design, 2010

2009

Stream Productivity by Outermost Termination

[BibT_eX]

[DOI]

Proceedings of the Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming, 2009

An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas

[BibT_eX]

[DOI]

Olga Tveretina

Carsten Sinz

Proceedings of the Proceedings Fourth Athens Colloquium on Algorithms and Complexity, 2009

Degrees of Undecidability in Rewriting

[BibT_eX]

[DOI]

Herman Geuvers

CoRR, 2009

Well-Definedness of Streams by Termination.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Formal Analysis of Non-determinism in Verilog Cell Library Simulation Models.

[BibT_eX]

[DOI]

Mohammad Reza Mousavi

Jan-Willem Roorda

Chris W. H. Strolenberg

Proceedings of the Formal Methods for Industrial Critical Systems, 2009

Degrees of Undecidability in Term Rewriting.

[BibT_eX]

[DOI]

Herman Geuvers

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

A Tool Proving Well-Definedness of Streams Using Termination Tools.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008

Matrix Interpretations for Proving Termination of Term Rewriting.

[BibT_eX]

[DOI]

Johannes Waldmann

J. Autom. Reason., 2008

A Transformational Approach to Prove Outermost Termination Automatically.

[BibT_eX]

[DOI]

Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming, 2008

Adding constants to string rewriting.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2008

Certification of Proving Termination of Term Rewriting by Matrix Interpretations.

[BibT_eX]

[DOI]

Adam Koprowski

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Normalization of Infinite Terms.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets.

[BibT_eX]

[DOI]

Stefan Wagemans

Dragan Bosnacki

Proceedings of the Bioinformatics Research and Development, 2008

2007

On tree automata that certify termination of left-linear term rewriting systems.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Generalizing DPLL and satisfiability for equalities.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Termination by Quasi-periodic Interpretations.

[BibT_eX]

[DOI]

Johannes Waldmann

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

The Termination Competition.

[BibT_eX]

[DOI]

Claude Marché

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

2006

Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems.

[BibT_eX]

[DOI]

Adam Koprowski

Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005

Termination of String Rewriting Proved Automatically.

[BibT_eX]

[DOI]

J. Autom. Reason., 2005

Finding finite automata that certify termination of string rewriting systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Generalized Innermost Rewriting.

[BibT_eX]

[DOI]

Jaco van de Pol

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Proving Liveness with Fairness Using Rewriting.

[BibT_eX]

[DOI]

Adam Koprowski

Proceedings of the Frontiers of Combining Systems, 5th International Workshop, 2005

Reducing Right-Hand Sides for Termination.

[BibT_eX]

[DOI]

Proceedings of the Processes, 2005

2004

Finding Finite Automata That Certify Termination of String Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2004

TORPA: Termination of Rewriting Proved Automatically.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

A Proof System and a Decision Procedure for Equality Logic.

[BibT_eX]

[DOI]

Olga Tveretina

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003

Transforming equality logic to propositional logic.

[BibT_eX]

[DOI]

Jan Friso Groote

Proceedings of the 4th International Workshop on First-Order Theorem Proving, 2003

Simulating liveness by reduction strategies.

[BibT_eX]

[DOI]

Jürgen Giesl

Proceedings of the 3rd International Workshop on Reduction Strategies in Rewriting and Programming, 2003

Resolution and binary decision diagrams cannot simulate each other polynomially.

[BibT_eX]

[DOI]

Jan Friso Groote

Discret. Appl. Math., 2003

Liveness in Rewriting.

[BibT_eX]

[DOI]

Jürgen Giesl

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

2002

Sizes of Ordered Decision Trees.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Int. J. Found. Comput. Sci., 2002

Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy.

[BibT_eX]

[DOI]

Inf. Comput., 2002

Relative Undecidability in Term Rewriting: I. The Termination Hierarchy.

[BibT_eX]

[DOI]

Inf. Comput., 2002

2001

A rewriting approach to binary decision diagrams.

[BibT_eX]

[DOI]

Jaco van de Pol

J. Log. Algebraic Methods Program., 2001

The Termination Hierarchy for Term Rewriting.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2001

2000

Finding Small Equivalent Decision Trees is Hard.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Int. J. Found. Comput. Sci., 2000

A Complete Characterization of Termination of 0p 1q-> 1r 0s.

[BibT_eX]

[DOI]

Alfons Geser

Appl. Algebra Eng. Commun. Comput., 2000

Binary Decision Diagrams by Shard Rewriting.

[BibT_eX]

[DOI]

Jaco van de Pol

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999

Non-looping string rewriting.

[BibT_eX]

[DOI]

Alfons Geser

RAIRO Theor. Informatics Appl., 1999

1997

Simple Termination of Rewrite Systems.

[BibT_eX]

[DOI]

Aart Middeldorp

Theor. Comput. Sci., 1997

Termination Modulo Equations by Abstract Commutation with an Application to Iteration.

[BibT_eX]

[DOI]

Wan J. Fokkink

Theor. Comput. Sci., 1997

Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Termination of Context-Sensitive Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

1996

Total termination of term rewriting.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1996

Relative Undecidability in Term Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 10th International Workshop, 1996

Transforming Termination by Self-Labelling.

[BibT_eX]

[DOI]

Aart Middeldorp

Hitoshi Ohsaki

Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995

Total Termination of Term Rewriting is Undecidable.

[BibT_eX]

[DOI]

J. Symb. Comput., 1995

Termination of Term Rewriting by Semantic Labelling.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1995

A Complete Characterization of Termination of Op 1q -> 1r Os.

[BibT_eX]

[DOI]

Alfons Geser

Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Rewrite Systems for Integer Arithmetic.

[BibT_eX]

[DOI]

H. R. Walters

Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Termination of Logic Programs Using Semantic Unification.

[BibT_eX]

[DOI]

Thomas Arts

Proceedings of the Logic Programming Synthesis and Transformation, 1995

Dummy Elimination: Making Termination Easier.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

Termination of Term Rewriting: Interpretation and Type Elimination.

[BibT_eX]

[DOI]

J. Symb. Comput., 1994

Basic Process Algebra with Iteration: Completeness of its Equational Axioms.

[BibT_eX]

[DOI]

Wan J. Fokkink

Comput. J., 1994

Well-foundedness of Term Orderings.

[BibT_eX]

[DOI]

Proceedings of the Conditional and Typed Rewriting Systems, 4th International Workshop, 1994

Simple Termination Revisited.

[BibT_eX]

[DOI]

Aart Middeldorp

Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

Syntactical Analysis of Total Termination.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Logic Programming, 4th International Conference, 1994

1992

Longest Segment Problems.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1992

Termination of Term Rewriting by Interpretation.

[BibT_eX]

[DOI]

Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

Type Removal in Term Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

1991

Minimizing Sums of Addition Chains.

[BibT_eX]

[DOI]