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 φ).
Similar content being viewed by others
References
Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theor. Comput. Sci. 18, 215–248 (1982)
Berstel, J., Reutenauer, C.: Séries rationelles. Paris: Masson 1984
Bozapalidis, S., Alexandrakis, A.: Répresentations matricielles des séries d’arbre reconnaissables. Inf. Théor. Applicat. 23, 449–459 (1989)
Bozapalidis, S., Louscou-Bozapalidou, O.: The rank of a formal tree power series. Theoret. Comput. Sci. 27, 211–215 (1983)
Eilenberg, S.: Automata, languages and machines. New York: Academic Press 1974
Kuich, W., Salomaa, A.: Semirings, automata, languages. Berlin Heidelberg New York: Springer 1986
Salomaa, A., Soittola, M.: Automata theoretic aspects of formal power series. Berlin Heidelberg New York: Springer 1978
Reutenauer, C.: Séries formelles et algébres syntactiques. J. Algebra 66, 448–483 (1980)
Author information
Authors and Affiliations
Rights 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
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01212960