4 citations
4 papers
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
Joost Engelfriet, Sebastian Maneth
It is decidable for deterministic MSO definable graph-to-string or graph-to-tree transducers whether they are equivalent on a context-free set of graphs.
Time, Space, and Energy in Reversible Computing
Paul Vitanyi
We survey results of a quarter century of work on computation by reversible general-purpose computers (in this setting Turing machines), and general reversible simulation of irreve…
Removing Propagation Redundant Constraints in Redundant Modeling
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with various degrees of constraint propagation for pruning the search space. O…
Finite Domain Bounds Consistency Revisited
Chiu Wo Choi, Warwick Harvey, Jimmy Ho-Man Lee +1
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati…