3 papers
cs.LO2025
Complete Compositional Syntax for Finite Transducers on Finite and Bi-Infinite Words
Titouan Carette, Marc de Visme, Vivien Ducros +2
Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility…
quant-ph2021
Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory
Titouan Carette, Marc de Visme, Simon Perdrix
Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite number of qubits. Meanw…
cs.LO2016
Strategies with Parallel Causes
Marc de Visme, Glynn Winskel
In a distributed game we imagine a team Player engaging a team Opponent in a distributed fashion. Such games and their strategies have been formalised in concurrent games based on…