Tree Automata and Essential Subtrees

Simple item page
dc.creatorShtrakov, Slavcho
dc.date2007-02-23
dc.date.accessioned2026-07-07T07:48:26Z
dc.date.available2026-07-07T07:48:26Z
dc.descriptionWe 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.
dc.description9 pages, 2 figures, Sixth International Conference on Discrete Mathematics and Applications, Bansko, 2001
dc.identifierhttps://arxiv.org/abs/cs/0702137
dc.identifierhttp://arxiv.org/abs/cs/0702137
dc.identifierProc. of ICDMA, 31.08-02.09.2001, Bansko, v.6, 51-60 p
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/124498
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectF.1.1; F.1.2
dc.titleTree Automata and Essential Subtrees
dc.typetext

Files

Collections

arXiv