Atlas home ||
Conferences |
Abstracts |
about Atlas
6th International Conference on Discrete Mathematics and Applications
August 31 - September 2, 2001
South-West University
Blagoevgrad, Bulgaria |
|
Organizers
K. Denecke, Sl. Shtrakov
View Abstracts
Conference Homepage |
Hypersubstitutions in Computer Science
by
K. Denecke
University of Potsdam
Hypersubstitutions are mappings from a set of operation symbols
going into the corresponding set of terms.
The theory of hypersubstitutions and hyperidentities is
well-developed and can be aplied to
- tree automata (to generalize them to hyper-tree-automata)
-
tree transformations and tree transducers
-
the semantical and syntactical hyperunification problem.
Each of these applications will be discussed under the aspect of the
advantages of hypersubstitutions compared with usual substitutions.
Date received: May 8, 2001
Copyright © 2001 by the author(s).
The author(s) of this document and the organizers of the conference
have granted their consent to include this abstract in
Atlas Conferences Inc.
Document # cahn-03.