Search Results - "Jörg Endrullis"

Transducer degrees: atoms, infima and suprema by Endrullis, Jörg, Klop, Jan Willem, Bakhshi, Rena

“…Although finite state transducers are very natural and simple devices, surprisingly little is known about the transducibility relation they induce on streams…”
Get full text

Star Games and Hydras by Jörg Endrullis, Jan Willem Klop, Roy Overbeek

“…The recursive path ordering is an established and crucial tool in term rewriting to prove termination. We revisit its presentation by means of some simple…”
Get full text

PBPO+ Graph Rewriting in Context: Invited Presentation at the Twelfth International Workshop on Computing with Terms and Graphs by Endrullis, Jörg

Get full text

From Linear Term Rewriting to Graph Rewriting with Preservation of Termination by Overbeek, Roy, Endrullis, Jörg

Get full text

Termination of Graph Transformation Systems Using Weighted Subgraph Counting by Overbeek, Roy, Endrullis, Jörg

“…We introduce a termination method for the algebraic graph transformation framework PBPO+, in which we weigh objects by summing a class of weighted morphisms…”
Get full text

A PBPO+ Graph Rewriting Tutorial by Overbeek, Roy, Endrullis, Jörg

Get full text

Matrix Interpretations for Proving Termination of Term Rewriting by Endrullis, Jörg, Waldmann, Johannes, Zantema, Hans

“…We present a new method for automatically proving termination of term rewriting. It is based on the well-known idea of interpretation of terms where every…”
Get full text

Majority Digraphs by Lai, Tri, Endrullis, Jörg, Moss, Lawrence S.

“…majority digraph is a finite simple digraph G=(V,\to ) such that there exist finite sets A_v for the vertices v\in V with the following property: u\to v if and…”
Get full text

Decreasing Diagrams for Confluence and Commutation by Jörg Endrullis, Jan Willem Klop, Roy Overbeek

“…Like termination, confluence is a central property of rewrite systems. Unlike for termination, however, there exists no known complexity hierarchy for…”
Get full text

Highlights in infinitary rewriting and lambda calculus by Endrullis, Jörg, Hendriks, Dimitri, Klop, Jan Willem

“…We present some highlights from the emerging theory of infinitary rewriting, both for first-order term rewriting systems and λ-calculus. In the first section…”
Get full text

Lazy productivity via termination by Endrullis, Jörg, Hendriks, Dimitri

“…We present a procedure for transforming strongly sequential constructor-based term rewriting systems (TRSs) into context-sensitive TRSs in such a way that…”
Get full text

Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic by Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva

“…We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform, coinductive…”
Get full text

Non-Termination of Cycle Rewriting by Finite Automata: Invited Presentation at the 9th International Workshop on Computing with Terms and Graphs by Endrullis, Jörg

Get full text

Graph rewriting and relabeling with PBPO+: A unifying theory for quasitoposes by Overbeek, Roy, Endrullis, Jörg, Rosset, Aloïs

“…We extend the powerful Pullback-Pushout (PBPO) approach for graph rewriting with strong matching. Our approach, called PBPO+, allows more control over the…”
Get full text

Productivity of stream definitions by Endrullis, Jörg, Grabmayer, Clemens, Hendriks, Dimitri, Isihara, Ariya, Klop, Jan Willem

“…We give an algorithm for deciding productivity of a large and natural class of recursive stream definitions. A stream definition is called ‘productive’ if it…”
Get full text

Levels of undecidability in rewriting by Endrullis, Jörg, Geuvers, Herman, Simonsen, Jakob Grue, Zantema, Hans

“…Undecidability of various properties of first-order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the…”
Get full text

On equal μ -terms by Endrullis, Jörg, Grabmayer, Clemens, Klop, Jan Willem, van Oostrom, Vincent

“…We consider the rewrite system R μ with μ x . M → μ M [ x : = μ x . M ] as its single rewrite rule, where the signature consists of the variable binding…”
Get full text

Fast leader election in anonymous rings with bounded expected delay by Bakhshi, Rena, Endrullis, Jörg, Fokkink, Wan, Pang, Jun

“…We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE…”
Get full text

Termination of Graph Transformation Systems Using Weighted Subgraph Counting by Overbeek, Roy, Endrullis, Jörg

“…Logical Methods in Computer Science, Volume 20, Issue 4 (November 12, 2024) lmcs:12700 We introduce a termination method for the algebraic graph transformation…”
Get full text

Local Termination: theory and practice by Endrullis, Joerg, de Vrijer, Roel, Waldmann, Johannes

“…The characterisation of termination using well-founded monotone algebras has been a milestone on the way to automated termination techniques, of which we have…”
Get full text