Algebraic Approach to Incomparable Families of Formal Languages

摘要

The author extends some results of Ginsburg and Spanier on incomparable fullAbstract Families of Languages (AFL's) to similar structures like full hyper-AFL's, full hyper(1)-AFL's and prequasoids. A general approach based on universal algebra and lattice theory enables one to establish Ginsburg and Spanier-like theorems for several types of language families. It turns out that a considerable part of the proofs is algebraic or lattice-theoretic in nature. On the other hand formal language theory provides language families that may serve as (counter) examples in algebra.