Tree automata and separable sets of input variables
Computational Complexity
2007-05-23 v1 Discrete Mathematics
Abstract
We consider the computational complexity of tree transducers, depending on their separable sets of input variables.
Keywords
Cite
@article{arxiv.cs/0702123,
title = {Tree automata and separable sets of input variables},
author = {Slavcho Shtrakov and Vladimir Shtrakov},
journal= {arXiv preprint arXiv:cs/0702123},
year = {2007}
}
Comments
8 pages, 2 figures