3 citations · 4 across the 5 of their papers we have counts for
5 papers
Regularity Preserving but not Reflecting Encodings
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
Encodings, that is, injective functions from words to words, have been studied extensively in several settings. In computability theory the notion of encoding is crucial for defini…
Eigenvalues and Transduction of Morphic Sequences: Extended Version
David Sprunger, William Tune, Jörg Endrullis +1
We study finite state transduction of automatic and morphic sequences. Dekking proved that morphic sequences are closed under transduction and in particular morphic images. We pres…
Non-termination using Regular Languages
Jörg Endrullis, Hans Zantema
We describe a method for proving non-looping non-termination, that is, of term rewriting systems that do not admit looping reductions. As certificates of non-termination, we employ…
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples
Joerg Endrullis, Clemens Grabmayer, Dimitri Hendriks +2
We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show…
Asynchronous Bounded Expected Delay Networks
Rena Bakhshi, Jörg Endrullis, Wan Fokkink +1
The commonly used asynchronous bounded delay (ABD) network models assume a fixed bound on message delay. We propose a probabilistic network model, called asynchronous bounded expec…