![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
We study context free closed families of languages, that is families L verifying the equation
CF º L = L
where CF denotes the family of context free languages and º is the substitution operation. Call a family L a context free AFL if it is both context free closed and a rational cone. The families CF and RE (of recursively enumerable languages) have this property. We show that the class of context free AFL's is properly contained into that of full AFL's. Moreover the context free AFL generated by a family L, is given by the formula
L Δ = CF º LΓ
where LΓ denotes the rational cone generated by L. Using this result we establish the remarkable inclusion
(L º M)Δ ⊃ LΔ º MΔ
holding for all families L and M as well as the equality
LΔ = CF º LΓ
LΓ being the full AFL generated by L.
Keywords: