Tree automata and separable sets of input variables
arXiv:cs/0702123
Abstract
We consider the computational complexity of tree transducers, depending on their separable sets of input variables.
8 pages, 2 figures
arXiv:cs/0702123
We consider the computational complexity of tree transducers, depending on their separable sets of input variables.
8 pages, 2 figures