"The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is ..."

Yves Andre, Francis Bossut (1995)

> Home

Details and statistics

DOI: 10.1007/3-540-59293-8_193

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/tapsoft/AndreB95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tapsoft/AndreB95
Yves Andre, Francis Bossut:
The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable. TAPSOFT 1995: 155-171

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.