A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs. - Clemens Grabmayer (TERMGRAPH, 2002)

Using Proofs by Coinduction to Find "Traditional" Proofs. - Clemens Grabmayer (CALCO, 2005)

Reflections on a Geometry of Processes. - Clemens Grabmayer; Jan Willem Klop; Bas Luttik (APC 25, 2005)

Some Remarks on Definability of Process Graphs. - Clemens Grabmayer; Jan Willem Klop; Bas Luttik (CONCUR, 2006)

A characterization of regular expressions under bisimulation. - Jos C. M. Baeten; Flavio Corradini; Clemens Grabmayer (J. ACM, 2007)

A duality between proof systems for cyclic term graphs. - Clemens Grabmayer (Math. Struct. Comput. Sci., 2007)

Data-Oblivious Stream Productivity. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks (LPAR, 2008)

Proving Infinitary Normalization. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop; Roel C. de Vrijer (TYPES, 2008)

Complexity of Fractran and Productivity. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks (CADE, 2009)

Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop (CoRR, 2009)

From Abstract Rewriting Systems to Abstract Proof Systems - Clemens Grabmayer (CoRR, 2009)

Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop; Vincent van Oostrom (RTA, 2010)

Productivity of stream definitions. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Ariya Isihara; Jan Willem Klop (Theor. Comput. Sci., 2010)

Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress) - Jan Rochel; Clemens Grabmayer (TERMGRAPH, 2011)

On the Termination of Russell's Description Elimination Algorithm. - Clemens Grabmayer; Joop Leo; Vincent van Oostrom; Albert Visser (Rev. Symb. Log., 2011)

On equal μ-terms. - Jörg Endrullis; Clemens Grabmayer; Jan Willem Klop; Vincent van Oostrom (Theor. Comput. Sci., 2011)

Automatic Sequences and Zip-Specifications. - Clemens Grabmayer; Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Lawrence S. Moss (LICS, 2012)

Expressive power of digraph solvability. - Marc Bezem; Clemens Grabmayer; Michal Walicki (Ann. Pure Appl. Log., 2012)

Expressibility in the Lambda Calculus with Letrec - Clemens Grabmayer; Jan Rochel (CoRR, 2012)

Mix-Automatic Sequences. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks (LATA, 2013)

Expressibility in the Lambda Calculus with Mu. - Clemens Grabmayer; Jan Rochel (RTA, 2013)

Term Graph Representations for Cyclic Lambda-Terms - Clemens Grabmayer; Jan Rochel (TERMGRAPH, 2013)

Maximal sharing in the Lambda calculus with letrec. - Clemens Grabmayer; Jan Rochel (ICFP, 2014)

Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop; Vincent van Oostrom (Log. Methods Comput. Sci., 2014)

Nested Term Graphs. - Clemens Grabmayer; Vincent van Oostrom (TERMGRAPH, 2014)

The Degree of Squares is an Atom. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Hans Zantema (WORDS, 2015)

Regularity Preserving but Not Reflecting Encodings. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks (LICS, 2015)

The Degree of Squares is an Atom (Extended Version). - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Hans Zantema (CoRR, 2015)

Linear Depth Increase of Lambda Terms in Leftmost-Outermost Beta-Reduction Rewrite Sequences. - Clemens Grabmayer (CoRR, 2016)

Modeling Terms by Graphs with Structure Constraints (Two Illustrations). - Clemens Grabmayer (TERMGRAPH@FSCD, 2018)

A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity. - Clemens Grabmayer; Wan J. Fokkink (LICS, 2020)

Structure-Constrained Process Graphs for the Process Semantics of Regular Expressions. - Clemens Grabmayer (TERMGRAPH@FSCD, 2020)

A Coinductive Version of Milner's Proof System for Regular Expressions Modulo Bisimilarity. - Clemens Grabmayer (CALCO, 2021)

Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete: Crystallization: Near-Collapsing Process Graph Interpretations of Regular Expressions. - Clemens Armin Grabmayer (LICS, 2022)

The Image of the Process Interpretation of Regular Expressions is Not Closed under Bisimulation Collapse. - Clemens Grabmayer (CoRR, 2023)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes. - Clemens Grabmayer (DCM, 2023)

A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity. - Clemens Grabmayer (Log. Methods Comput. Sci., 2023)