Some remarks on recognizable treeseries

References

• Berstel , J. and Reutenauer , C. 1984 . Les series rationelles et leurs languages Masson
   Google Scholar
• Berstel , J. and Reutenauer , C. 1982 . Recognizable formal power series on trees TCS , 18 : 215 – 248 .
   Google Scholar
• Bozapalidis , S. 1994 . Representable treeseries . Fund. In , 21 : 367 – 387 .
   Google Scholar
• Bozapalidis , S. and Alexandrakis , A. 1989 . Representations matricielles des series d’arbres reconnaissable RAIRO . Inf. Theor. Appl , 23 : 439 – 449 .
   Google Scholar
• Bozapalidis , S. 1991 . Effective constructions of the syntactic algebra of a recognizable series on trees . Acta Informatica , 28 : 351 – 363 .
   Google Scholar
• Eilenberg , S. 1974 . Automata , Languages and Machines Academic Press .
   Google Scholar
• Engelfriet , S. 1975 . Tree automata and tree grammars . DAIMI , FN:10
   Google Scholar
• Gecseg , F. and Steinby , M. 1984 . Tree Automata Akademiai Kiado , Budapest .
   Google Scholar
• Kuich , W. and Salomaa , A. 1986 . Semirings, Automata, Languages , Springer .
   Google Scholar
• Salomaa , A. and Soittola , M. 1978 . Automata theoretic aspects of formal power series , Springer .
   Google Scholar
• Schutzenberger , M.P. 1961 . On the definition of a family of automata . Information and Control , 4 : 245 – 270 .
   Google Scholar
• Sontag , E.D. 1975 . On some questions of rationality and decidability . J.Comp.System Sci , 11 : 375 – 385 .
   Google Scholar