Quantifier-free definable graph operations preserving recognizability
Résumé
We show that an operation on graphs, and more generally, on relational structures that has an inverse definable by a monadic second-order transduction preserves the family of recognizable sets.
Domaines
Logique en informatique [cs.LO]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...