|
Organizers |
Essential Inputs and Minimal Tree Automata
by
I. Damyanov
South-West University
Coauthors: Sl. Strakov
In the paper we continue studying essential inputs of trees and automata initiated in [1].
We distinguish the behaviour of the essential inputs of trees and essential variables for discrete functions.
Strongly essential inputs of trees are introduced too. It is proved that if a tree and an automaton have at least two essential inputs then they have at least one strongly essential input.
A minimization algorithm for trees and automata is proposed. Various examples for application in Computer Science are shown. [1] Sl. Shtrakov, Tree Automata and Essential Input Variables, 2000, Contributions to General Algebra 13, Proc. of the Dresden Conf. 2000, Verlag Johannes Heyn, Klagenfurt 2000.
Date received: July 27, 2001
Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cahn-21.