1 paper · 1 filter
Pablo Barceló, Diego Figueira, Rémi Morvan
We study the separability problem for automatic relations (i.e., relations on finite words definable by synchronous automata) in terms of recognizable relations (i.e., finite union…