This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Equivalence and Reduction of Expansive Tree Grammars
February 1981 (vol. 3 no. 2)
pp. 204-206
A. Barrero, Department of Electrical Engineering, University of Tennessee, Knoxville, TN 37916.
R. C. Gonzalez, Department of Electrical Engineering, University of Tennessee, Knoxville, TN 37916.
M. G. Thomason, Department of Computer Science, University of Tennessee, Knoxville, TN 37916.
The equivalence of nonterminals of an expansive tree grammar is considered. Algorithms are presented for constructing sets of equivalent nonterminals for an expansive tree grammar, for reducing the grammar, and for determining whether two grammars generate the same language.
Citation:
A. Barrero, R. C. Gonzalez, M. G. Thomason, "Equivalence and Reduction of Expansive Tree Grammars," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 2, pp. 204-206, Feb. 1981, doi:10.1109/TPAMI.1981.4767080
Usage of this product signifies your acceptance of the Terms of Use.