Jörg Endrullis

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 36

Top Topics

Arbitrarily Complex

Finite Automata

Top Venues

Log. Methods Comput. Sci.

Math. Struct. Comput. Sci.

Publications

Aloïs Rosset, Helle Hvid Hansen, Jörg Endrullis
Characterisation of Lawvere-Tierney Topologies on Simplicial Sets, Bicolored Graphs, and Fuzzy Sets. CoRR (2024)
Jörg Endrullis, Roy Overbeek
Generalized Weighted Type Graphs for Termination of Graph Transformation Systems. ICGT (2024)
Aloïs Rosset, Maaike Zwart, Helle Hvid Hansen, Jörg Endrullis
Correspondence between Composite Theories and Distributive Laws. CoRR (2024)
Aloïs Rosset, Maaike Zwart, Helle Hvid Hansen, Jörg Endrullis
Correspondence Between Composite Theories and Distributive Laws. CMCS (2024)
Roy Overbeek, Jörg Endrullis
A PBPO+ Graph Rewriting Tutorial. CoRR (2023)
Roy Overbeek, Jörg Endrullis
Termination of Graph Transformation Systems Using Weighted Subgraph Counting. ICGT (2023)
Aloïs Rosset, Roy Overbeek, Jörg Endrullis
Fuzzy Presheaves are Quasitoposes and Consequences in Graph Rewriting. CoRR (2023)
Aloïs Rosset, Roy Overbeek, Jörg Endrullis
Fuzzy Presheaves are Quasitoposes. ICGT (2023)
Jörg Endrullis, Roy Overbeek
Generalized Weighted Type Graphs for Termination of Graph Transformation Systems. CoRR (2023)
Roy Overbeek, Jörg Endrullis
Termination of Graph Transformation Systems using Weighted Subgraph Counting. CoRR (2023)
Roy Overbeek, Jörg Endrullis, Aloïs Rosset
: A unifying theory for quasitoposes. J. Log. Algebraic Methods Program. 133 (2023)
Aloïs Rosset, Helle Hvid Hansen, Jörg Endrullis
Algebraic Presentation of Semifree Monads. CMCS (2022)
Roy Overbeek, Jörg Endrullis, Aloïs Rosset
Graph Rewriting and Relabeling with PBPO+: A Unifying Theory for Quasitoposes. CoRR (2022)
Aloïs Rosset, Helle Hvid Hansen, Jörg Endrullis
Algebraic Presentation of Semifree Monads. CoRR (2022)
Roy Overbeek, Jörg Endrullis
From Linear Term Rewriting to Graph Rewriting with Preservation of Termination. GCM@STAF (2021)
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Star Games and Hydras. Log. Methods Comput. Sci. 17 (2) (2021)
Roy Overbeek, Jörg Endrullis, Aloïs Rosset
. ICGT (2021)
Jörg Endrullis, Jan Willem Klop, Rena Bakhshi
Transducer degrees: atoms, infima and suprema. Acta Informatica 57 (3-5) (2020)
Roy Overbeek, Jörg Endrullis
Patch Graph Rewriting. CoRR (2020)
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Decreasing Diagrams for Confluence and Commutation. Log. Methods Comput. Sci. 16 (1) (2020)
Roy Overbeek, Jörg Endrullis
Patch Graph Rewriting. ICGT (2020)
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Star Games and Hydras. CoRR (2020)
Roy Overbeek, Jörg Endrullis
Graph Rewriting and Relabeling with PBPO+ (Extended Version). CoRR (2020)
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Decreasing Diagrams for Confluence and Commutation. CoRR (2019)
Jörg Endrullis, Jan Willem Klop
Braids via term rewriting. Theor. Comput. Sci. 777 (2019)
Jörg Endrullis, Lawrence S. Moss
Syllogistic logic with "Most". Math. Struct. Comput. Sci. 29 (6) (2019)
Jörg Endrullis, Jan Willem Klop
Confluence of the Chinese Monoid. The Art of Modelling Computational Systems (2019)
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems. FSCD (2018)
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
Degrees of Infinite Words, Polynomials and Atoms. Int. J. Found. Comput. Sci. 29 (5) (2018)
Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva
Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic. Log. Methods Comput. Sci. 14 (1) (2018)
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
Degrees of Infinite Words, Polynomials, and Atoms (Extended Version). CoRR (2018)
Jörg Endrullis, Jeffrey O. Shallit, Tim Smith
Undecidability and Finite Automata. CoRR (2017)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky
Clocked lambda calculus. Math. Struct. Comput. Sci. 27 (5) (2017)
Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva
Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic. CoRR (2017)
Jörg Endrullis, Jeffrey O. Shallit, Tim Smith
Undecidability and Finite Automata. DLT (2017)
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
Degrees of Infinite Words, Polynomials and Atoms. DLT (2016)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
Regularity Preserving but not Reflecting Encodings. CoRR (2015)
Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva
A Coinductive Framework for Infinitary Rewriting and Equational Reasoning. RTA (2015)
Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva
A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (Extended Version). CoRR (2015)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
Regularity Preserving but Not Reflecting Encodings. LICS (2015)
Jörg Endrullis, Hans Zantema
Proving Looping and Non-Looping Non-Termination by Finite Automata. CoRR (2015)
Jörg Endrullis, Lawrence S. Moss
Syllogistic Logic with "Most". WoLLIC (2015)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema
The Degree of Squares is an Atom (Extended Version). CoRR (2015)
Jörg Endrullis, Hans Zantema
Proving non-termination by finite automata. RTA (2015)
Jörg Endrullis, Jan Willem Klop, Aleksi Saarela, Markus A. Whiteland
Degrees of Transducibility. WORDS (2015)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema
The Degree of Squares is an Atom. WORDS (2015)
Jörg Endrullis, Dimitri Hendriks
On periodically iterated morphisms. CSL-LICS (2014)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky
An Introduction to the Clocked Lambda Calculus. CoRR (2014)
David Sprunger, William Tune, Jörg Endrullis, Lawrence S. Moss
Eigenvalues and Transduction of Morphic Sequences: Extended Version. CoRR (2014)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky
Discriminating Lambda-Terms Using Clocked Boehm Trees Log. Methods Comput. Sci. 10 (2) (2014)
Jörg Endrullis, Dimitri Hendriks, Rena Bakhshi, Grigore Rosu
On the complexity of stream equality. J. Funct. Program. 24 (2-3) (2014)
David Sprunger, William Tune, Jörg Endrullis, Lawrence S. Moss
Eigenvalues and Transduction of Morphic Sequences. Developments in Language Theory (2014)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples. Log. Methods Comput. Sci. 10 (2) (2014)
Jörg Endrullis, Hans Zantema
Non-termination using Regular Languages. CoRR (2014)
Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva
A Coinductive Treatment of Infinitary Rewriting. CoRR (2013)
Jörg Endrullis, Dimitri Hendriks, Martin Bodin
Circular Coinduction in Coq Using Bisimulation-Up-To Techniques. ITP (2013)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
Mix-Automatic Sequences. LATA (2013)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
Streams are Forever. Bull. EATCS 109 (2013)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky
Clocks for Functional Programs. The Beauty of Functional Code (2013)
Jörg Endrullis, Dimitri Hendriks, Rena Bakhshi
On the complexity of equivalence of specifications of infinite objects. ICFP (2012)
Jörg Endrullis, Dimitri Hendriks, Rena Bakhshi
On the Complexity of Equivalence of Specifications of Infinite Objects CoRR (2012)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
Highlights in infinitary rewriting and lambda calculus. Theor. Comput. Sci. 464 (2012)
Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss
Automatic Sequences and Zip-Specifications CoRR (2012)
Dimitri Hendriks, Frits Dannenberg, Jörg Endrullis, Mark Dow, Jan Willem Klop
Arithmetic Self-Similarity of Infinite Sequences. CoRR (2012)
Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss
Automatic Sequences and Zip-Specifications. LICS (2012)
Jörg Endrullis, Dimitri Hendriks
On Periodically Iterated Morphisms CoRR (2012)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
Degrees of Streams. Integers (2011)
Rena Bakhshi, Jörg Endrullis, Wan J. Fokkink, Jun Pang
Fast leader election in anonymous rings with bounded expected delay. Inf. Process. Lett. 111 (17) (2011)
Jörg Endrullis, Andrew Polonsky
Infinitary Rewriting Coinductively. TYPES (2011)
Jörg Endrullis, Herman Geuvers, Jakob Grue Simonsen, Hans Zantema
Levels of undecidability in rewriting. Inf. Comput. 209 (2) (2011)
Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, Vincent van Oostrom
On equal μ-terms. Theor. Comput. Sci. 412 (28) (2011)
Jörg Endrullis, Dimitri Hendriks
Lazy productivity via termination. Theor. Comput. Sci. 412 (28) (2011)
Hans Zantema, Jörg Endrullis
Proving Equality of Streams Automatically. RTA (2011)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
Modular Construction of Fixed Point Combinators and Clocked Bohm Trees. LICS (2010)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom
Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. RTA (2010)
Rena Bakhshi, Jörg Endrullis, Wan J. Fokkink, Jun Pang
Brief announcement: asynchronous bounded expected delay networks. PODC (2010)
Jörg Endrullis
Levels of Undecidability in Infinitary Rewriting: Normalization and Reachability CoRR (2010)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop
Productivity of stream definitions. Theor. Comput. Sci. 411 (4-5) (2010)
Jörg Endrullis, Dimitri Hendriks
Transforming Outermost into Context-Sensitive Rewriting Log. Methods Comput. Sci. 6 (2) (2010)
Rena Bakhshi, Jörg Endrullis, Wan J. Fokkink, Jun Pang
Asynchronous Bounded Expected Delay Networks CoRR (2010)
Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann
Local Termination: theory and practice Log. Methods Comput. Sci. 6 (3) (2010)
Rena Bakhshi, Jörg Endrullis, Stefan Endrullis, Wan J. Fokkink, Boudewijn R. Haverkort
Automating the Mean-Field Method for Large Dynamic Gossip Networks. QEST (2010)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
Modular Construction of Fixed Point Combinators and Clocked Boehm Trees CoRR (2010)
Jörg Endrullis, Herman Geuvers, Hans Zantema
Degrees of Undecidability in Rewriting CoRR (2009)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
Let's Make a Difference! CoRR (2009)
Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann
Local Termination. RTA (2009)
Jörg Endrullis, Dimitri Hendriks
From Outermost to Context-Sensitive Rewriting. RTA (2009)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
Complexity of Fractran and Productivity. CADE (2009)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
Complexity of Fractran and Productivity CoRR (2009)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting CoRR (2009)
Jörg Endrullis, Herman Geuvers, Hans Zantema
Degrees of Undecidability in Term Rewriting. CSL (2009)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
Data-Oblivious Stream Productivity. LPAR (2008)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
Data-Oblivious Stream Productivity CoRR (2008)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel C. de Vrijer
Proving Infinitary Normalization. TYPES (2008)
Jörg Endrullis, Johannes Waldmann, Hans Zantema
Matrix Interpretations for Proving Termination of Term Rewriting. J. Autom. Reason. 40 (2-3) (2008)
Jörg Endrullis, Roel C. de Vrijer
Reduction Under Substitution. RTA (2008)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop
Productivity of Stream Definitions. FCT (2007)
Jörg Endrullis, Johannes Waldmann, Hans Zantema
Matrix Interpretations for Proving Termination of Term Rewriting. IJCAR (2006)