|
Organizers |
Tree-Hyperrecognizers
by
K. Denecke
University of Potsdam
The concept of a tree-hyperrecognizer generalizes that of a tree-recognizer and is based on the clone of all n-ary term operations of a finite algebra. Substitutions are replaced by hypersubstitutions. This allows to apply the theory of hyperidentities. Languages which are recognized by a tree-hyperrecognizer are called hyperrecognizable. A language is hyperrecognizable if and only if it is recognizable.
Date received: May 23, 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 # caee-62.