|
Algorithms for Depth and Size of Hypersubstitutions
by
Slavcho Shtrakov
South-West University, Blagoevgrad, Bulgaria
A formula for the depth of a hypersubstitution has been obtained by K. Denecke, J. Koppitz and the author. In this article two extensions of the definition of hypersubstitution are given. They are named general- and multi- hypersubstitutions. Some properties of these hypersubstitutions are described. We consider an inductive method for calculating the depth and the size of such hypersubstitutions.
Algorithms written in a Pascal like meta-language realize these methods. Additionally we prove necessary and sufficient conditions for a hypersubstitution to be a substitution.
Date received: December 19, 2000
Copyright © 2000 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 # cafo-31.