Essential Inputs and Minimal Tree Automata
<|reference_start|>Essential Inputs and Minimal Tree Automata: 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.<|reference_end|>
@article{damyanov2007essential,
    title={Essential Inputs and Minimal Tree Automata},
    author={Ivo Damyanov and Slavcho Shtrakov},
    journal={Proc. of ICDMA, 31.08-02.09.2001, Bansko, v.6, 77-85 p},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0702136},
    primaryClass={cs.CC cs.DM}
}