Essential Inputs and Minimal Tree Automata

Simple item page
dc.creatorDamyanov, Ivo
dc.creatorShtrakov, Slavcho
dc.date2007-02-23
dc.date.accessioned2026-07-07T07:48:26Z
dc.date.available2026-07-07T07:48:26Z
dc.descriptionWe 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.
dc.description7 pages, 1 figure, Sixth International Conference on Discrete Mathematics and Applications, 31.08-02.09.2001, Bansko
dc.identifierhttps://arxiv.org/abs/cs/0702136
dc.identifierhttp://arxiv.org/abs/cs/0702136
dc.identifierProc. of ICDMA, 31.08-02.09.2001, Bansko, v.6, 77-85 p
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/124497
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectF.1.1; F.1.2
dc.titleEssential Inputs and Minimal Tree Automata
dc.typetext

Files

Collections

arXiv