-Treeautomata and their relation to weighted context-free grammars

References

• Tsomokos I. -Treeautomata, Doctoral dissertation Dept. of Mathematics, University of Ioannina Greek April 1985
   Google Scholar
• Alexandrakis , A. and Bozapalidis , S. 1987 . Weighted Grammars and Kleen's Theorem . Information Processing Letters , 24 : 1 – 4 .
   Google Scholar
• Thatcher , J. W. 1970 . Generalized2 Sequential Machine Maps . J. Computer and System Sci. , 4 : 339 – 367 .
   Google Scholar
• Rounds , W. C. 1970 . Mappings and Grammars on Trees . Math. Systems Theory , 4 ( No. 3 ) : 257 – 287 .
   Google Scholar
• Eilenberg , S. 1974 . Automata, Languages and Machines , Vol. 4 , Academic Press .
   Google Scholar
• Bozapalidis , S. and Louscou-Bozapalidou , O. 1983 . The Rank of a Formal Tree Power Series . Theor. comp. Sci. , 27
   Google Scholar
• Salomaa , A. and Soittola , M. 1978 . Automata Theoretic Aspects of Formal Power Series , Springer-Verlag .
   Google Scholar