25 search results - page 1 / 5 » The Complexity of Tree Transducer Output Languages |
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in NSPACE(n) and hence are context-sensitive, and the class ...
PODS
2010
ACM
13 years 9 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
ICDT
2003
ACM
13 years 9 months ago
2003
ACM
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
JCSS
2002
13 years 4 months ago
2002
IANDC
1998
13 years 4 months ago
1998
ed tree transducers are abstract models used to study properties bute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that...