1 citations · 1 across the 2 of their papers we have counts for
2 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…
cs.DM2024★ 1 cited
Bootstrap percolation on rhombus tilings
S Esnay, V Lutfalla, G Theyssier
2-boostrap percolation on a graph is a diffusion process where a vertex gets infected whenever it has at least 2 infected neighbours, and then stays infected forever. It has been m…