Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite systems. Recent results provide confluence criteria for conditional term rewrite systems via transformations, yet they are restricted to CTRSs with ...

Weak probabilistic bisimulation on probabilistic automata can be decided by an algorithm that needs to check a polynomial number of linear programming problems encoding weak transitions. It is hence polynomial, but not guaranteed to be strongly polynomial. In this paper we show that for polynomial rational probabilistic automata strong polynomial complexity can be ensured. We further discuss co...

After two papers on weak cubical categories and collarable cospans, respectively, we put things together and construct a weak cubical category of cubical collared cospans of topological spaces. We also build a second structure, called a quasi cubical category, formed of arbitrary cubical cospans concatenated by homotopy pushouts. This structure, simpler but weaker, has lax identities. It contai...

A brief review of recent results on computing contributions of higher dimension operators to weak effective ∆S = 1, 2 hamiltonians for light quarks is presented.