4 votes 4 votes The tail of a language is the set of all suffixes of its strings, that is tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }. How do I show that the family of regular languages is closed under this operation. Theory of Computation theory-of-computation regular-language finite-automata regular-expression + – Garrett McClure asked Oct 9, 2017 Garrett McClure 1.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Suffix(L)=Reverse(prefix(Reveres(L))) //we know reverse and prefix closed under regular Hence suffix(L) also regular i.e. L={abc} then suffix(L)={^,c,bc,abc} Avijit Shaw answered Dec 3, 2018 Avijit Shaw comment Share Follow See all 0 reply Please log in or register to add a comment.