Register

Closure property of languages

437 views
1 votes
1 votes
Can someone help me to understand this with example....  or provide proper reasource for that

Homomorphism

quotient

Epsilon free homomorphism

inverse of homomorphism

substitution
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.1k
views
1 answers
1 votes
Na462 asked Jan 13, 2019
1,085 views
MadeEasy Subject Test 2019: Theory of Computation - Closure Property
Consider the following Statements :There Exist a non-deterministic CFL whose reversal is DCFL.There exist a non regular CSL whose Kleene Closure is regular.Which of following are True ?Explain with reasons.
User Avatar
547
views
0 answers
0 votes
Sambhrant Maurya asked Jan 9, 2019
547 views
MadeEasy Test Series: Theory Of Computation - Closure Property
L1 is regular, L2 and L3 are CFLL1 is regular, L2 is CFL and L3 is CSLL1 is CFL but not regular,L2 is CSL but not CFL,L3 is CFLL1, L2 and L3 are CFL
User Avatar
649
views
2 answers
0 votes
Dhoomketu asked May 10, 2018
649 views
Theory of computation - Closure Property
Cfl is closed under intersection with regular language.Then resultant languages will be regular or cfl ?Let X is cflY is regular language L=X intersection YThen L is what?
User Avatar
923
views
1 answers
2 votes
raviyogi asked Nov 4, 2017
923 views
Ace Test Series: Theory Of Computation - Closure Property
please explain:
User Avatar
Link Copied!