The Gateway to Computer Science Excellence
+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.
in Theory of Computation by (265 points) | 316 views

1 Answer

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}
by (125 points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,405 answers
105,467 users