# Conference Publications

## 2018

- Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable SystemsJörg Endrullis, Jan Willem Klop, and Roy OverbeekIn: Proc. Conf. on Formal Structures for Computation and Deduction (FSCD 2018), pp. 14:1–14:15, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)

## 2017

- Undecidability and Finite AutomataJörg Endrullis, Jeffrey Shallit, and Tim SmithIn: Proc. Conf. Developments in Language Theory (DLT 2017), pp. 160–172, Springer (2017)

## 2016

- Degrees of Infinite Words, Polynomials and AtomsJörg Endrullis, Juhani Karhumäki, Jan Willem Klop, and Aleksi SaarelaIn: Proc. Conf. on Developments in Language Theory (DLT 2016), pp. 164–176, Springer (2016)

## 2015

- Syllogistic Logic with "Most"Jörg Endrullis, and Lawrence S. MossIn: Proc. Int. Workshop on Logic, Language, Information, and Computation (WoLLIC 2015), pp. 124–139, Springer (2015)
- Regularity Preserving but Not Reflecting EncodingsJörg Endrullis, Clemens Grabmayer, and Dimitri HendriksIn: Proc. Symp. on Logic in Computer Science (LICS 2015), pp. 535–546, IEEE Computer Society (2015)
- Proving Non-Termination by Finite AutomataJörg Endrullis, and Hans ZantemaIn: Proc. Conf. on Rewriting Techniques and Applications (RTA 2015), pp. 160–176, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)
- Degrees of TransducibilityJörg Endrullis, Jan Willem Klop, Aleksi Saarela, and Markus A. WhitelandIn: Proc. Conf. on Combinatorics on Words (WORDS 2015), pp. 1–13, Springer (2015)
- The Degree of Squares Is an AtomJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, and Hans ZantemaIn: Proc. Conf. on Combinatorics on Words (WORDS 2015), pp. 109–121, Springer (2015)
- A Coinductive Framework for Infinitary Rewriting and Equational ReasoningJörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, and Alexandra SilvaIn: Proc. Conf. on Rewriting Techniques and Applications (RTA 2015), pp. 143–159, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)

## 2014

- Eigenvalues and Transduction of Morphic SequencesDavid Sprunger, William Tune, Jörg Endrullis, and Lawrence S. MossIn: Proc. Conf. on Developments in Language Theory (DLT 2014), pp. 239–251, Springer (2014)
- On Periodically Iterated MorphismsJörg Endrullis, and Dimitri HendriksIn: Joint Meeting and the Conference on Computer Science Logic (CSL) and the Symposium on Logic in Computer Science (LICS), pp. 39:1–39:10, ACM (2014)

## 2013

- Mix-Automatic SequencesJörg Endrullis, Clemens Grabmayer, and Dimitri HendriksIn: Proc. Conf. on Language and Automata Theory and Applications (LATA 2013), pp. 262–274, Springer (2013)
- Circular Coinduction in Coq Using Bisimulation-Up-To TechniquesJörg Endrullis, Dimitri Hendriks, and Martin BodinIn: Proc. Conf. on Interactive Theorem Proving (ITP 2013), pp. 354–369, Springer (2013)

## 2012

- Automatic Sequences and Zip-SpecificationsClemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, and Lawrence S. MossIn: Proc. Symp. on Logic in Computer Science (LICS 2012), pp. 335–344, IEEE Computer Society (2012)
- On the Complexity of Equivalence of Specifications of Infinite ObjectsJörg Endrullis, Dimitri Hendriks, and Rena BakhshiIn: Proc. Int. Conf. on Functional Programming (ICFP 2012), pp. 153–164, ACM (2012)

## 2011

- Proving Equality of Streams AutomaticallyHans Zantema, and Jörg EndrullisIn: Proc. Conf. on Rewriting Techniques and Applications (RTA 2011), pp. 393–408, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)
- Infinitary Rewriting CoinductivelyJörg Endrullis, and Andrew PolonskyIn: Proc. Conf. on Types for Proofs and Programs (TYPES 2012), pp. 16–27, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)

## 2010

- Brief Announcement: Asynchronous Bounded Expected Delay NetworksRena Bakhshi, Jörg Endrullis, Wan Fokkink, and Jun PangIn: Proc. Symp. on Principles of Distributed Computing (PODC 2010), pp. 392–393, ACM (2010)
- Automating the Mean-Field Method for Large Dynamic Gossip NetworksRena Bakhshi, Jörg Endrullis, Stefan Endrullis, Wan Fokkink, and Boudewijn R. HaverkortIn: Proc. Conf. on Quantitative Evaluation of Systems (QEST 2010), pp. 241–250, IEEE Computer Society (2010)
- Modular Construction of Fixed Point Combinators and Clocked Böhm TreesJörg Endrullis, Dimitri Hendriks, and Jan Willem KlopIn: Proc. Symp. on Logic in Computer Science (LICS 2010), pp. 111–119, IEEE Computer Society (2010)
- Unique Normal Forms in Infinitary Weakly Orthogonal RewritingJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, and Vincent van OostromIn: Proc. Conf. on Rewriting Techniques and Applications (RTA 2010), pp. 85–102, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)

## 2009

- From Outermost to Context-Sensitive RewritingJörg Endrullis, and Dimitri HendriksIn: Proc. Conf. on Rewriting Techniques and Applications (RTA 2009), pp. 305–319, Springer (2009)
- Local TerminationJörg Endrullis, Roel C. de Vrijer, and Johannes WaldmannIn: Proc. Conf. on Rewriting Techniques and Applications (RTA 2009), pp. 270–284, Springer (2009)
- Complexity of Fractran and ProductivityJörg Endrullis, Clemens Grabmayer, and Dimitri HendriksIn: Proc. Conf. on Automated Deduction (CADE 2009), pp. 371–387, Springer (2009)
- Degrees of Undecidability in Term RewritingJörg Endrullis, Herman Geuvers, and Hans ZantemaIn: Proc. Conf. on Computer Science Logic (CSL 2009), pp. 255–270, Springer (2009)

## 2008

- Data-Oblivious Stream ProductivityJörg Endrullis, Clemens Grabmayer, and Dimitri HendriksIn: Proc. Conf. on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2008), pp. 79–96, Springer (2008)
- Reduction under SubstitutionJörg Endrullis, and Roel C. de VrijerIn: Proc. Conf. on Rewriting Techniques and Applications (RTA 2008), pp. 425–440, Springer (2008)
- Proving Infinitary NormalizationJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, and Roel C. de VrijerIn: Proc. Conf. on Types for Proofs and Programs (TYPES 2008), pp. 64–82, Springer (2008)

## 2007

- Productivity of Stream DefinitionsJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, and Jan Willem KlopIn: Proc. Symp. on Fundamentals of Computation Theory (FCT 2007), pp. 274–287, Springer (2007)

## 2006

- Matrix Interpretations for Proving Termination of Term RewritingJörg Endrullis, Johannes Waldmann, and Hans ZantemaIn: Proc. Int. Joint Conf. on Automated Reasoning (IJCAR 2006), pp. 574–588, Springer (2006)