DocumentCode
3013168
Title
Minimization of deterministic tree grammars and automata
Author
Barrero, A. ; Gonzalez, R.C.
Author_Institution
University of Tennessee, Knoxville, Tennessee
fYear
1976
fDate
1-3 Dec. 1976
Firstpage
404
Lastpage
407
Abstract
The efficient use of tree representations in pattern recognition requires the construction of deterministic tree automata with a minimum number of states. The conditions for minimization of tree automata are extended and algorithms for the elimination of useless symbols are presented.
Keywords
Automata; Contracts; Pattern recognition; Production;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control including the 15th Symposium on Adaptive Processes, 1976 IEEE Conference on
Conference_Location
Clearwater, FL, USA
Type
conf
DOI
10.1109/CDC.1976.267766
Filename
4045626
Link To Document