Essential Inputs and Minimal Tree Automata
arXiv:cs/0702136
Abstract
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