Essential Inputs and Minimal Tree Automata

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We continue studying essential inputs of trees and automata. Strongly essential inputs of trees are introduced and studied. Various examples for application in Computer Science are shown.
7 pages, 1 figure, Sixth International Conference on Discrete Mathematics and Applications, 31.08-02.09.2001, Bansko

Keywords

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

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0702136
 http://arxiv.org/abs/cs/0702136
 Proc. of ICDMA, 31.08-02.09.2001, Bansko, v.6, 77-85 p

Collections

arXiv