6 search results - page 2 / 2 » Relating Tree Series Transducers and Weighted Tree Automata |
FSTTCS
2001
Springer
13 years 9 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...