Essential Inputs and Minimal Tree Automata
计算复杂性
2007-05-23 v1 离散数学
摘要
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.
引用
@article{arxiv.cs/0702136,
title = {Essential Inputs and Minimal Tree Automata},
author = {Ivo Damyanov and Slavcho Shtrakov},
journal= {arXiv preprint arXiv:cs/0702136},
year = {2007}
}
备注
7 pages, 1 figure, Sixth International Conference on Discrete Mathematics and Applications, 31.08-02.09.2001, Bansko