Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity

Clemens Grabmayer.
Milner (1984) defined an operational semantics for regular expressions as finite-state processes. In order to axiomatize bisimilarity of regular expressions under this process semantics, he adapted Salomaa's proof system that is complete for equality of regular expressions under the language&nbsp;[&hellip;]
Published on June 29, 2023

Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples

Joerg Endrullis ; Clemens Grabmayer ; Dimitri Hendriks ; Jan Willem Klop ; Vincent van Oostrom.
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 that the infinitary unique normal form property fails by an example of a weakly orthogonal TRS with two collapsing&nbsp;[&hellip;]
Published on June 8, 2014

  • < Previous
  • 1
  • Next >