PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2001 | 21 | 2 | 219-227
Tytuł artykułu

Tree transformations defined by hypersubstitutions

Treść / Zawartość
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
Tree transducers are systems which transform trees into trees just as automata transform strings into strings. They produce transformations, i.e. sets consisting of pairs of trees where the first components are trees belonging to a first language and the second components belong to a second language. In this paper we consider hypersubstitutions, i.e. mappings which map operation symbols of the first language into terms of the second one and tree transformations defined by such hypersubstitutions. We prove that the set of all tree transformations which are defined by hypersubstitutions of a given type forms a monoid with respect to the composition of binary relations which is isomorphic to the monoid of all hypersubstitutions of this type. We characterize transitivity, reflexivity and symmetry of tree transformations by properties of the corresponding hypersubstitutions. The results will be applied to languages built up by individual variables and one operation symbol of arity n ≥ 2.
Twórcy
autor
  • Chiang Mai University, Department of Mathematics, 50200 Chiang Mai, Thailand
  • University of Potsdam, Institute of Mathematics, 14415 Potsdam, Germany
Bibliografia
  • [1] K. Denecke, J. Koppitz and St. Niwczyk, Equational Theories generated by Hypersubstitutions of Type (n), Internat. J. Algebra Comput., to appear.
  • [2] K. Denecke, D. Lau, R. Pöschel and D. Schweigert, Hyperidentities, Hyperequational classes and clone congruences, Contributions to General Algebra 7 (1991), 97-118.
  • [3] K. Denecke and S.L. Wismath, The monoid of hypersubstitutions of type (2), Contributions to General Algebra 10 (1998), 109-126.
  • [4] K. Denecke and S.L. Wismath, Hyperidentities and Clones, Gordon and Breach Sci. Publ., Amsterdam 2000.
  • [5] F. Gécseg and M. Steinby, Tree Automata, Akadémiai Kiadó, Budapest 1984.
  • [6] J.W. Thatcher, Tree Automata: an informal survey, 'Currents in the theory of computing', Prentice-Hall, Englewood Cliffs, NJ, 1973, 143-172.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.bwnjournal-article-doi-10_7151_dmgaa_1039
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.