Tree automata and separable sets of input variables
计算复杂性
2007-05-23 v1 离散数学
摘要
We consider the computational complexity of tree transducers, depending on their separable sets of input variables.
关键词
引用
@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}
}
备注
8 pages, 2 figures