Skip to main content
Log in

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

  • Published:
International Journal of Biometeorology Aims and scope Submit manuscript

Summary

In this paper we exhibit two different effective constructions of the syntactic algebraA S associated to a recognizable formal series on treesS.

The one method consists of a direct construction of

(=a copy ofA S ) 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 toA S and thus independent of the choice of (A S φ).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theor. Comput. Sci. 18, 215–248 (1982)

    Google Scholar 

  2. Berstel, J., Reutenauer, C.: Séries rationelles. Paris: Masson 1984

    Google Scholar 

  3. Bozapalidis, S., Alexandrakis, A.: Répresentations matricielles des séries d’arbre reconnaissables. Inf. Théor. Applicat. 23, 449–459 (1989)

    Google Scholar 

  4. Bozapalidis, S., Louscou-Bozapalidou, O.: The rank of a formal tree power series. Theoret. Comput. Sci. 27, 211–215 (1983)

    Article  Google Scholar 

  5. Eilenberg, S.: Automata, languages and machines. New York: Academic Press 1974

    Google Scholar 

  6. Kuich, W., Salomaa, A.: Semirings, automata, languages. Berlin Heidelberg New York: Springer 1986

    Google Scholar 

  7. Salomaa, A., Soittola, M.: Automata theoretic aspects of formal power series. Berlin Heidelberg New York: Springer 1978

    Google Scholar 

  8. Reutenauer, C.: Séries formelles et algébres syntactiques. J. Algebra 66, 448–483 (1980)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bozapalidis, S. Effective construction of the syntactic algebra of a recognizable series on trees. Int J Biometeorol 36, 351–363 (1992). https://doi.org/10.1007/BF01212960

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01212960

Keywords

Navigation