7 search results - page 1 / 2 » Output String Languages of Compositions of Deterministic Mac... |
JCSS
2002
13 years 4 months ago
2002
FSTTCS
2008
Springer
13 years 6 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 ...
ACL
1992
13 years 6 months ago
1992
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
PLANX
2008
13 years 6 months ago
2008
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because t...
PODS
2010
ACM
13 years 10 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 ...