398 citations
- Dalle Molle Institute for Artificial Intelligence ResearchCH4 papers
- The University of MelbourneAU3 papers
- Australian National UniversityAU2 papers
- Chinese University of Hong KongHK2 papers
- UNSW SydneyAU2 papers
- Centrum Wiskunde & InformaticaNL1 paper
- École Polytechnique Fédérale de LausanneCH1 paper
- Graz University of TechnologyAT1 paper
- Institut national de recherche en sciences et technologies du numériqueFR1 paper
- Laboratoire d'Informatique de l'École PolytechniqueFR1 paper
- Laboratoire d’Informatique Fondamentale de MarseilleFR1 paper
- Leiden UniversityNL1 paper
Showing 2005Show all
2 papers · 1 filter
cs.LO2005★ 3 cited
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.
cs.CC2005
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…