Tree Automata and Essential Subtrees
Slavcho Shtrakov
TL;DR
This paper introduces the concept of essential subtrees for terms and tree automata, exploring properties of independent and separable sets of subtrees within trees and automata.
Contribution
It presents new theoretical concepts of essential subtrees and analyzes their properties in the context of tree automata.
Findings
Results on independent sets of subtrees
Results on separable sets for trees and automata
Theoretical framework for essential subtrees
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · semigroups and automata theory · Rough Sets and Fuzzy Logic