Tree automata and separable sets of input variables
<|reference_start|>Tree automata and separable sets of input variables: We consider the computational complexity of tree transducers, depending on their separable sets of input variables.<|reference_end|>
@article{shtrakov2007tree,
    title={Tree automata and separable sets of input variables},
    author={Slavcho Shtrakov and Vladimir Shtrakov},
    journal={J. FILOMAT, v. 15, 2001, University of Nis, 61-71 p., ISSN
  0354-5180 (http://www.pmf.ni.ac.yu/sajt/publikacije/filomat_15.html)},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0702123},
    primaryClass={cs.CC cs.DM}
}