Effective construction of the syntactic algebra of a recognizable series on trees

SummaryIn this paper we exhibit two different effective constructions of the syntactic algebraAS associated to a recognizable formal series on treesS.The one method consists of a direct construction of (=a copy ofAS) which is the subspace with the natural algebra structure.We first determine a basis of the subspace and then, using the junction isomorphism we obtain a basis for.The second method consists of considering an arbitrary surjective realization (A, φ) ofS, defining an appropriate ideal ℬ ofA and then constructing the quotient algebraA/ℬ this quotient is isomorphic toAS and thus independent of the choice of (AS φ).

[1]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[2]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[3]  Christophe Reutenauer Séries formelles et algèbres syntactiques , 1980 .

[4]  Jean Berstel,et al.  Recognizable Formal Power Series on Trees , 1982, Theor. Comput. Sci..

[5]  Symeon Bozapalidis,et al.  The Rank of a Formal Tree Power Series , 1983, Theor. Comput. Sci..

[6]  Arto Salomaa,et al.  Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.

[7]  Symeon Bozapalidis,et al.  Représentations Matricielles Des Séries D'Arbre Reconnaissables , 1989, RAIRO Theor. Informatics Appl..