Computer Science – Computational Complexity
Scientific paper
2007-02-23
Proc. of ICDMA, 31.08-02.09.2001, Bansko, v.6, 51-60 p
Computer Science
Computational Complexity
9 pages, 2 figures, Sixth International Conference on Discrete Mathematics and Applications, Bansko, 2001
Scientific paper
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.
No associations
LandOfFree
Tree Automata and Essential Subtrees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Tree Automata and Essential Subtrees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree Automata and Essential Subtrees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-691918