Adherences of DOL languages
An algorithm is given for constructing satisfactory representations of each of the sequences belonging to the adherence of an arbitrary DOL- language. This is done by the use of auxiliary DOL-systems. The solution of the adherence equivalence problem is completed for DOL-languages by employing the solution of the limit equivalence problem to auxiliary DOL- system.
scientific article; zbMATH DE number 3943054
scientific article