Tree Automata and Essential Subtrees

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 pages, 2 figures, Sixth International Conference on Discrete Mathematics and Applications, Bansko, 2001

Keywords

Computational Complexity, Discrete Mathematics, F.1.1; F.1.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/124498

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0702137
 http://arxiv.org/abs/cs/0702137
 Proc. of ICDMA, 31.08-02.09.2001, Bansko, v.6, 51-60 p

Collections

arXiv