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.
cs.CC↗
arXiv subjects
Publications and source records attributed to Ivo Damyanov.
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.