2 papers
cs.LO2026
On first-order definable operations on relational structures
Bruno Courcelle
We survey the definitions and main properties of first-order (FO) definable unary operations on relational structures, called FO-transductions, and of FO-definable binary operation…
cs.LO2025
On describing trees and quasi-trees from their leaves
Bruno Courcelle
Generalized trees, we call them O-trees, are defined as hierarchical partial orders, i.e., such that the elements larger than any one are linearly ordered. Quasi-trees are, roughly…