Publication Date:
2021-04-15
Description:
In the paper [13] Păun, Polkowski and Skowron introduce several indiscernibility relations among strings that are infinite index equivalence or tolerance relations, and study lower and upper rough approximations of languages defined by them. In this paper we develop a further study of some of these indiscernibility relations among strings. We characterize the classes defined by them, and the rough approximations of general and context free languages under them. We also compare some of the rough approximations these relations produce to the ones given by the congruences defining testable, reverse testable, locally testable, piecewise testable and commutative languages. Those yield languages belonging to that families. Next, we modify some of the relations to obtain congruences, and study the families of languages the rough approximations under them give rise to. One of these modificated relations turns out to be the k-abelian congruence, that was defined by J. Karhumäki in [7], in the context of combinatorics on words. We show that it defines a pseudo-principal +-variety, a term defined in [9]. Our results in that work are then applied to determine when a given language has a best upper approximation in that family. Finally, we make some comments on the accuracy of the rough approximations obtained in each case.
Print ISSN:
0169-2968
Electronic ISSN:
1875-8681
Topics:
Computer Science
