Tree Automata and Essential Subtrees
Computational Complexity
2007-05-23 v1 Discrete Mathematics
Abstract
We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.
Keywords
Cite
@article{arxiv.cs/0702137,
title = {Tree Automata and Essential Subtrees},
author = {Slavcho Shtrakov},
journal= {arXiv preprint arXiv:cs/0702137},
year = {2007}
}
Comments
9 pages, 2 figures, Sixth International Conference on Discrete Mathematics and Applications, Bansko, 2001